subdivision graphs
ZAGREB INDICES AND MULTIPLICATIVE ZAGREB INDICES OF DOUBLE GRAPHS OF SUBDIVISION GRAPHS
... In this section, similarly to the above section, we shall calculate the multiplicative Zagreb indices of double graphs, subdivision graphs, subdivision of double graphs and double ...
9
Topological Indices of the Total Graph of Subdivision Graphs
... the subdivision graphs of the tadpole, wheel, helm and ladder graphs ...line graphs of subdivision graphs of tadpole, wheel and ladder graphs in ...of subdivision ...
5
On the F-index and F-coindex of the line graphs of the subdivision graphs
... Several graphs found in molecular graph theory are com- posed of simpler graphs as their building ...molecular graphs of a large number of nanostructures can be obtained as the subdivision ...
7
A NOTE ON CERTAIN TOPOLOGICAL INDICES OF THE DERIVED GRAPHS OF SUBDIVISION GRAPHS
... Proof. The line graph of friendship graph has 3n vertices and n(2n + 1) edges, among them n vertices are of degree two and 2n vertices of degree 2n. Therefore we get the edge partition, based on the degrees of vertices ...
12
Some results on subdivision graphs
... By a graph G=(V,E) we mean a finite undirected graph without loops or multiple edges. Terms defined here are used in the sense of Harary [1972]. A subset S of V is called a dominating set of G if every vertex not in S is ...
6
Further results on odd mean labeling of some subdivision graphs
... of graphs was first introduced by Rosa in 1961 [1] and ...mean graphs are discussed in [5, 6, 9, ...mean graphs are discussed in [8, 11, 12, ...
18
Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs
... Ranjini et al. [10] calculated the Zagreb indices and coindices of the line graph of the subdivision graph of tadpole graph, wheel and ladder. Later Ramane et al. [9] generalized these results by finding the ...
12
The Schultz and modified Schultz polynomials of certain subdivision and line subdivision graphs
... The subdivision graph is the graph obtained by inserting an additional vertex into each edge of G, denoted as S(G). The line graph, of a graph G is the graph whose vertices are the edges of the graph G, and two ...
7
A Comparison on Metric Dimension of Graphs, Line Graphs, and Line Graphs of the Subdivision Graphs
... The subdivision graph S(G) of a graph G is obtained from G by deleting every edge uv of G and replacing it by a vertex w of degree 2 that is joined to u and v [see ...
15
ON CERTAIN TOPOLOGICAL INDICES OF THE DERIVED GRAPHS OF SUBDIVISION GRAPHS
... Now we define some notions of the graph theory. The subdivision graph S(G) is the graph obtained from G by replacing each of its edge by a path of length 2. The line graph L(G) of graph G is the graph whose ...
9
Two New Multiplicative Atom Bond Connectivity Indices
... Abstract. In this paper, we introduce second and fourth multiplicative atom bond connectivity indices of a graph. A topological index is a numeric quantity from structural graph of a molecule. In this paper, we determine ...
7
Total eccentricity index of some composite graphs
... different subdivision graphs and then determine some explicit expression of the total eccentricity index of the double graph, extended double cover graph and some generalized thorn ...
7
Difference Cordial Labeling of Subdivision of Snake Graphs
... Let G = (V, E) be a (p, q) graph. In this paper we have considered only simple, non-trivial and undirected graphs. The number of vertices of G is called the order of G and the number of edges of G is called the ...
6
On Some Labelings of Subdivision of Snake Graphs
... The subdivision of a graph is the graph obtained by subdividing each edge of a graph G is called the subdivision of G and is denoted by ...for subdivision of triangular snake, double triangular ...
10
Resistance Distance and Kirchhoff Index of Two Edge-subdivision Corona Graphs
... and Kirchhoff index of a given graph and obtained its closed formula. The subdivision graph S(G) of a graph G is the graph obtained by inserting a new vertex into every edge of G. The set of such new vertices is ...
7
Super C Logarithmic Meanness of Graphs Obtained from Paths
... A graph that admits a Super -logarithmic mean labeling is called a Super -logarithmic mean graph. In this manuscript, some of the graphs like path, total graph of a path, middle graph of a path, triangular ladder, ...
5
Vol 7, No 9 (2016)
... T he eccentric connectivity index based on degree and eccentricity of the vertices of a graph is a widely used graph invariant in mathematics. In this paper we present the explicit generalized expression for the ...
5
A Note on Domatic Subdivision Stable Graphs
... dss graphs by applying other graph operations like union, intersection, ring sum ...larger graphs from smaller ones, one can also do the opposite, decompose a large graph, that is dss graph to smaller ...
6
$Z_k$-Magic Labeling of Some Families of Graphs
... ditions. A detailed survey was done by Gallian in [5]. If the labels of edges are distinct positive integers and for each vertex v the sum of the labels of all edges incident with v is the same for every vertex v in the ...
12
Vol 9, No 4 (2018)
... The graph G= (V, E) is considered here will be finite, simple and undirected. We follow Gallian[1] for all detailed survey of graph labeling and we refer Harary [2] for all other standard terminologies and notations. The ...
9