Related papers: Extremal cacti with respect to Sombor index
Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…
The Wiener index is maximized over the set of trees with the given vertex weight and degree sequences. This model covers the traditional "unweighed" Wiener index, the terminal Wiener index, and the vertex distance index. It is shown that…
Recently, a couple of degree-based topological indices, defined using a geometrical point of view of a graph edge, have attracted significant attention and being extensively investigated. Furtula and Oz [Complementary Topological Indices,…
The eccentric connectivity index $\xi^c$ is a novel distance--based molecular structure descriptor that was recently used for mathematical modeling of biological activities of diverse nature. It is defined as $\xi^c (G) = \sum_{v \in V (G)}…
This study explores the irregularity properties of trees with prescribed degree sequences by analyzing two prominent topological indices: the Albertson index and the sigma index. With a particular emphasis on caterpillar trees -frequently…
The eccentricity of a vertex, $ecc_T(v) = \max_{u\in T} d_T(v,u)$, was one of the first, distance-based, tree invariants studied. The total eccentricity of a tree, $Ecc(T)$, is the sum of eccentricities of its vertices. We determine…
Recently, Behr introduced a notion of the chromatic index of signed graphs and proved that for every signed graph $(G$, $\sigma)$ it holds that \[ \Delta(G)\leq\chi'(G\text{, }\sigma)\leq\Delta(G)+1\text{,} \] where $\Delta(G)$ is the…
Let $G$ be a graph. Denote by $d_x$, $E(G)$, and $D(G)$ the degree of a vertex $x$ in $G$, the set of edges of $G$, and the degree set of $G$, respectively. This paper proposes to investigate (both from mathematical and applications points…
A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ contains at least a $\frac{1}{6}$ fraction of the triangular…
The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in terms of the vertex or edge connectivity of a graph. We…
An upper bound of the superbridge index of the connected sum of two knots is given in terms of the braid index of the summands. Using this upper bound and minimal polygonal presentations, we give an upper bound in terms of the superbridge…
The vertex $k$-partiteness $v_k(G)$ of graph $G$ is defined as the fewest number of vertices whose deletion from $G$ yields a $k$-partite graph. In this paper, we introduce two concepts: monotonic decreasing topological index and monotonic…
A network can be analyzed by means of many graph theoretical parameters. In the context of networks analysis, closeness is a structural metric that evaluates a node's significance inside a network. A cactus is a connected graph in which any…
Let $D=(V,A)$ be a digraphs without isolated vertices. A vertex-degree based invariant $I(D)$ related to a real function $\varphi$ of $D$ is defined as a summation over all arcs, $I(D) = \frac{1}{2}\sum_{uv\in A}{\varphi(d_u^+,d_v^-)}$,…
Do\v{s}li\'{c} et al. defined the Mostar index of a graph $G$ as $Mo(G)=\sum\limits_{uv\in E(G)}|n_G(u,v)-n_G(v,u)|$, where, for an edge $uv$ of $G$, the term $n_G(u,v)$ denotes the number of vertices of $G$ that have a smaller distance in…
We show that the number of noncommensurable lattices, hence also that of maximal lattices in SO(1,n) is at least exponential. To do so we construct large families of noncommensurable hybrid hyperbolic (Gromov/Piatetski-Shapiro) manifolds.
Let $G = (V, E)$ be a graph with non-empty set of vertices $V$ and set of edges $E$. The \emph{eccentric connectivity index} of the graph $G$ is defined as $$\displaystyle{\xi^C(G) = \sum_{u \in V} d_u \;ecc(u)}$$ where $d_u$ is the degree…
Let $G=(V,E)$ be a simple graph. The concept of Inverse symmetric division deg index $(ISDD)$ was introduced in the chemical graph theory very recently. In spite of this, a few papers have already appeared with this index in the literature.…
The poset of maximal tubings of a graph generalizes several well-known and remarkable partial orders. Notable examples include the weak Bruhat order and the Tamari lattice, posets of maximal tubings for the complete graph and the path…
The total eccentricity index of a connected graph is defined as sum of the eccentricities of all its vertices. We denote the set of all connected graphs on $n$ vertices with $k$ pendant vertices by $\mathfrak{H}_{n,k}$ and denote the set of…