pith. machine review for the scientific record. sign in

arxiv: 1611.02819 · v1 · submitted 2016-11-09 · 🧮 math.CO

Recognition: unknown

Splice Graphs and Their Topological Indices

Authors on Pith no claims yet
classification 🧮 math.CO
keywords graphsspliceindicesverticescalculateconnectivitydefineddisjoint
0
0 comments X
read the original abstract

Let $G_1=(V_1,E_1)$ and $G_2=(V_2,E_2)$ be two graphs with disjoint vertex sets $V_1$ and $V_2$. Let $u_1 \in V_1$ and $u_2 \in V_2$. A splice of $G_1$ and $G_2$ by vertices $u_1$ and $u_2$, $\mathcal{S}(G_1,G_2;u_1,u_2)$, is defined by identifying the vertices $u_1$ and $u_2$ in the union of $G_1$ and $G_2$. In this paper we calculate the Szeged, edge-Szeged, $PI$, vertex-$PI$ and eccentric connectivity indices of splice graphs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.