Results 81 to 90 of about 305 (179)
Zagreb Indices of Trees, Unicyclic and Bicyclic Graphs With Given (Total) Domination
IEEE Access, 2019 Let G = (V, E) be a (molecular) graph. For a family of graphs G, the first Zagreb index M1 and the second Zagreb index M2 have already studied. In particular, it has been presented, the first Zagreb index M1 and the second Zagreb index M2 of trees T in ...
Doost Ali Mojdeh +3 more
doaj +1 more source
Induced Geodetic Sequence of a Graph [PDF]
Transactions on CombinatoricsA vertex subset $S$ of a graph $G=(V,E)$ is said to be a geodetic set if every vertex in $G$ is in some $u-v$ geodesic for any $u,v \in S$. The minimum cardinality of such a set is the geodetic number, which is denoted as $g(G)$.
Liju Olickal, John Mulloor
doaj +1 more source
On the global offensive alliance in unicycle graphs
AKCE International Journal of Graphs and Combinatorics, 2018 11 pages, 1 ...
Mohamed Bouzefrane, Saliha Ouatiki
openaire +4 more sources
Spectrum of Unicyclic Graph [PDF]
Advances in Computer Science Research, 2022 Agung Lukito +3 more
openaire +1 more source
The number of independent sets in unicyclic graphs
Discrete Applied Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pedersen, Anders Sune +1 more
openaire +4 more sources
Solutions of Detour Distance Graph Equations. [PDF]
Sensors (Basel), 2022 Prabha SC +7 more
europepmc +1 more source
Maximum Laplacian energy of unicyclic graphs
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Chandra Das +3 more
openaire +2 more sources
The determinant of a unicyclic graph’s neighborhood matrix
Linear Algebra and its Applications, 2005 Let \(G\) be a unicyclic graph with \(n\) vertices and a unique cycle, \(A(G)\) denotes the adjacency matrix of the graph \(G\). The algorithm for computing the determinant function of the matrix \(\alpha I_n+A(G)\) which uses \(O(n)\) arithmetic operations under some restrictions on the degrees of the vertices of the graph \(G\) is obtained. Among the
openaire +2 more sources
On the Laplacian index of tadpole graphs
Special MatricesIn this article, we study the Laplacian index of tadpole graphs, which are unicyclic graphs formed by adding an edge between a cycle Ck{C}_{k} and a path Pn{P}_{n}.
Braga Rodrigo O., Veloso Bruno S.
doaj +1 more source
A structural approach to the graceful coloring of a subclass of trees. [PDF]
Heliyon, 2023 D L, S DY.
europepmc +1 more source