相关论文: Topological Indices Among Strong Support Vertex

Let $\mathcal{T}_n$ be the set of all mappings $T:[n]\to[n]$, where $[n]=\{1,2,\ldots,n\}$. The corresponding graph $G_T$ of $T$, called a functional digraph, is a union of disjoint connected components. Each component is a directed cycle…

We study the Sombor index of trees with various degree restrictions. In addition to rediscovering that among all trees with a given degree sequence, the greedy tree minimises the Sombor index and the alternating greedy tree maximises it, we…

A sign pattern is a matrix whose entries belong to the set $\{+,-,0\}$. A sign pattern requires a unique inertia if every real matrix in its qualitative class has the same inertia. Symmetric tree sign patterns requiring a unique inertia has…

The terminal Wiener index of a tree is the sum of distances for all pairs of pendent vertices, which recently arises in the study of phylogenetic tree reconstruction and the neighborhood of trees. This paper presents a sharp upper and lower…

Overlap is a common phenomenon seen when structural components of a digital object are neither disjoint nor nested inside each other. Overlapping components resist reduction to a structural hierarchy, and tree-based indexing and query…

We investigate various strong notions of rigidity for Souslin trees, separating them under Diamond into a hierarchy. Applying our methods to the automorphism tower problem in group theory, we show under Diamond that there is a group whose…

One can use the number theoretic idea of the notion of natural density \cite{B1} to define topological s-torsion elements (which form the statistically characterized subgroups, recently developed in \cite{DPK}) extending Armacost's idea of…

In chemical graph theory, caterpillar trees have been an appealing model to represent the molecular structures of benzenoid hydrocarbon. Meanwhile, topological index has been thought of as a powerful tool for modeling quantitative…

A rigorous way to obtain sharp bounds for Stokes constants is introduced and illustrated on a concrete problem arising in applications.

We study torus bundles with affine structure groups. First, we establish a rigidity result under constraints on the first Betti numbers: If $ \text{b}_{1}(M)-\text{b}_{1}(N)=\dim M-\dim N $ holds for a torus bundle $M$ with an affine…

We study some topological properties of trees with the interval topology. In particular, we characterize trees which admit a 2-fibered compactification and we present two examples of trees whose one-point compactifications are Rosenthal…

The dynamical phenomena of complex networks are very difficult to predict from local information due to the rich microstructures and corresponding complex dynamics. On the other hands, it is a horrible job to compute some stochastic…

A classical result of Koml\'os, S\'ark\"ozy and Szemer\'edi states that every $n$-vertex graph with minimum degree at least $(1/2+ o(1))n$ contains every $n$-vertex tree with maximum degree $O(n/\log{n})$ as a subgraph, and the bounds on…

The relation between the Wiener index $W(G)$ and the eccentricity $\varepsilon(G)$ of a graph $G$ is studied. Lower and upper bounds on $W(G)$ in terms of $\varepsilon(G)$ are proved and extremal graphs characterized. A Nordhaus-Gaddum type…

The association between tie strength and social structure is a fundamental topic in the social sciences. We study this association by analyzing tie strength in higher-order networks, an increasingly relevant model which can encode group…

The atom-bond connectivity (ABC) index is a degree-based topological index. It was introduced due to its applications in modeling the properties of certain molecular structures and has been since extensively studied. In this note, we…

Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…

Suppose $\Sigma$ is a topological space and $S(\Sigma)$ is the vector lattice of all equivalent classes of continuous real-valued functions defined on open dense subsets of $\Sigma$. In this paper, we establish some lattice and topological…

The paper attempts to validate the effectiveness of tree classifiers to classify tabla strokes especially the ones which are overlapping in nature. It uses decision tree, ID3 and random forest as classifiers. A custom made data sets of 650…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right],$ define the matrix $A_{\alpha}\left(G\right) $ as \[ A_{\alpha}\left(G\right) =\alpha…