Related papers: Splice Graphs and Their Topological Indices

We consider topological indices I that are sums of f(deg(u)) f(deg(v)), where {u,v} are adjacent vertices and f is a function. The Randi{\'c} connectivity index or the Zagreb group index are examples for indices of this kind. In earlier…

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. Let $G$ be a connected graph…

Let $S\subseteq V(G)$ and $\pi_{G}(S)$ denote the maximum number $t$ of edge-disjoint paths $P_{1},P_{2},\ldots,P_{t}$ in a graph $G$ such that $V(P_{i})\cap V(P_{j})=S$ for any $i,j\in\{1,2,\ldots,t\}$ and $i\neq j$. If $S=V(G)$, then…

Given a connected graph $G(V, E)$, the edge dimension, denoted $\mathrm{edim}(G)$, is the least size of a set $S \subseteq V$ that distinguishes every pair of edges of $G$, in the sense that the edges have pairwise distinct tuples of…

Let $\G(v,e)$ be the set of all simple graphs with $v$ vertices and $e$ edges and let $P_2(G)=\sum d_i^2$ denote the sum of the squares of the degrees, $d_1, >..., d_v$, of the vertices of $G$. It is known that the maximum value of $P_2(G)$…

Let $G$ be a cyclically $5$-connected cubic graph with a $5$-edge-cut separating $G$ into two cyclic components $G_1$ and $G_2$. We prove that each component $G_i$ can be completed to a cyclically $5$-connected cubic graph by adding three…

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

Let $G$ be a graph and $k \geq 3$ an integer. A subset $D \subseteq V(G)$ is a $k$-clique (resp., cycle) isolating set of $G$ if $G-N[D]$ contains no $k$-clique (resp., cycle). In this paper, we prove that every connected graph with maximum…

The first multiplicative Zagreb index of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the degree of each edge over all edges. In our work, we explore the…

The intersection graph of a family of sets $\{S_{1},S_{2},\ldots,S_{n}\}$ is a graph whose vertex set is $\{S_{1},S_{2},\ldots,S_{n}\}$ and two distinct vertices are adjacent if the intersection of the corresponding sets is non-empty.…

Let $G=(V,E)$ be a twinless strongly connected graph. a vertex $v\in V$ is a twinless articulation point if the subrgraph obtained from $G$ by removing the vertex $v$ is not twinless strongly connected. An edge $e\in E$ is a twinless bridge…

The complementary second Zagreb index of a graph $G$ is defined as $cM_2(G)=\sum_{uv\in E(G)}|(d_u(G))^2-(d_v(G))^2|$, where $d_u(G)$ denotes the degree of a vertex $u$ in $G$ and $E(G)$ represents the edge set of $G$. Let $G^*$ be a graph…

Topological indices have been used to modeling biological and chemical properties of molecules in quantitive structure property relationship studies and quantitive structure activity studies. All the degree based topological indices have…

Let $G=(V,E)$ be a directed graph. A $2$-edge-twinless block in $G$ is a maximal vertex set $C^{t}\subseteq V$ with $|C^{t}|>1$ such that for any distinct vertices $v,w \in C^{t}$, and for every edge $e\in E$, the vertices $v,w$ are in the…

Let $\pi_1=(d_1^{(1)}, \ldots,d_n^{(1)})$ and $\pi_2=(d_1^{(2)},\ldots,d_n^{(2)})$ be graphic sequences. We say they \emph{pack} if there exist edge-disjoint realizations $G_1$ and $G_2$ of $\pi_1$ and $\pi_2$, respectively, on vertex set…

The $k$-th symmetric product of a graph $G$ with vertex set $V$ with edge set $E$ is a graph with vertices as $k$-sets of $V$, where two $k$-sets are connected by an edge if and only if their symmetric difference is an edge in $E$. Using…

The visibility graph of a finite set of points in the plane has the points as vertices and an edge between two vertices if the line segment between them contains no other points. This paper establishes bounds on the edge- and…

This survey gives an overview of three central algebraic themes related to the study of splines: duality, group actions, and homology. Splines are piecewise polynomial functions of a prescribed order of smoothness on some subdivided domain…

The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph. This was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced to study the structure-dependency of total…

For a set $S$ of vertices and the vertex $v$ in a connected graph $G$, $\displaystyle\max_{x \in S}d(x,v)$ is called the $S$-eccentricity of $v$ in $G$. The set of vertices with minimum $S$-eccentricity is called the $S$-center of $G$. Any…