Zagreb Indices and Coindices of Total Graph, Semi-Total Point Graph and Semi-Total Line Graph of Subdivision Graphs
Authors
Abstract:
Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.
similar resources
Topological Indices of the Total Graph of Subdivision Graphs
In this paper, we compute topological indices of the total graphs of the tadpole graphs, wheel graphs and ladder graphs using the subdivision concept, which extend the results of Ranjini et al. (2011).
full textZagreb Polynomials and Multiple Zagreb Indices for the Line Graphs of Banana Tree Graph, Firecracker Graph and Subdivision Graphs
A chemical graph can be recognized by a numerical number (topological index), algebraic polynomial or any matrix. These numbers and polynomials help to predict many physico-chemical properties of underline chemical compound. In this paper, 1Corresponding author. we compute first and second Zagreb polynomials and multiple Zagreb indices of the Line graphs of Banana tree graph, Firecracker graph ...
full textDOMINATION NUMBER OF TOTAL GRAPH OF MODULE
Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...
full textOn the Zagreb and Eccentricity Coindices of Graph Products
The second Zagreb coindex is a well-known graph invariant defined as the total degree product of all non-adjacent vertex pairs in a graph. The second Zagreb eccentricity coindex is defined analogously to the second Zagreb coindex by replacing the vertex degrees with the vertex eccentricities. In this paper, we present exact expressions or sharp lower bounds for the second Zagreb eccentricity co...
full textTotal graph of a $0$-distributive lattice
Let £ be a $0$-distributive lattice with the least element $0$, the greatest element $1$, and ${rm Z}(£)$ its set of zero-divisors. In this paper, we introduce the total graph of £, denoted by ${rm T}(G (£))$. It is the graph with all elements of £ as vertices, and for distinct $x, y in £$, the vertices $x$ and $y$ are adjacent if and only if $x vee y in {rm Z}(£)$. The basic properties of the ...
full textA Study of the Total Graph
Let R be a commutative ring with $Z(R)$ its set of zero-divisors. In this paper, we study the total graph of $R$, denoted by $T(Gamma(R))$. It is the (undirected) graph with all elements of R as vertices, and for distinct $x, yin R$, the vertices $x$ and $y$ are adjacent if and only if $x + yinZ(R)$. We study the chromatic number and edge connectivity of this graph.
full textMy Resources
Journal title
volume 5 issue 1
pages 1- 12
publication date 2020-06-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023