Results 91 to 100 of about 3,013 (185)
The Harary Index of All Unicyclic Graphs with Given Diameter
Discrete Dynamics in Nature and Society, 2018 The Harary index of G is the sum of reciprocals of distance between any two vertices in G. In this paper, we obtain the graphs with the maximum and second-maximum Harary indices among n-vertex unicyclic graphs with diameter d.
Bao-Hua Xing +3 more
doaj +1 more source
Spectrum of Unicyclic Graph [PDF]
Advances in Computer Science Research, 2022 Agung Lukito +3 more
openaire +1 more source
On the core of a unicyclic graph
Ars Mathematica Contemporanea, 2012 8 pages, 5 ...
Levit, Vadim E., Mandrescu, Eugen
openaire +3 more sources
Graphs which have pancyclic complements
International Journal of Mathematics and Mathematical Sciences, 1978 Let p and q denote the number of vertices and edges of a graph G, respectively. Let Δ(G) denote the maximum degree of G, and G¯ the complement of G. A graph G of order p is said to be pancyclic if G contains a cycle of each length n, 3≤n≤p.
H. Joseph Straight
doaj +1 more source
, 2020 {"references": ["1.\tJ. Amalorpava Jerline, L. Benedict Michaelraj, On a conjecture of harmonic index and diameter of graphs, Kragujevac Journal of Mathematics, 40(1), (2016),73-78. 2.\tR. Balakrishnan, K. Ranganathan, A Textbook of Graph Theory, Springer-Verlog, New York, 2000. 3.\tH. Deng, S. Balachandran, S. K. Ayyaswamy, Y. B.
I. Ignomary, S. Suganya
openaire +1 more source
Isolate Domination in Unicyclic Graphs
International Journal of Mathematics and Soft Computing, 2013 A subset $D$ of the vertex set $V(G)$ of a graph $G$ is called a dominating set of $G$ if every vertex in $V-D$ is adjacent to a vertex in $D$. A dominating set $D$ such that $$ has an isolated vertex is called an isolate dominating set and the minimum cardinality of an isolate dominating set is called the isolate domination number of $G$ and is ...
S. Balamurugan, I. Sahul Hamid
openaire +1 more source
The Least Algebraic Connectivity of Graphs
Discrete Dynamics in Nature and Society, 2015 The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian matrix of the graph, which is a parameter to measure how well a graph is connected.
Guisheng Jiang, Guidong Yu, Jinde Cao
doaj +1 more source
Solutions of Detour Distance Graph Equations. [PDF]
Sensors (Basel), 2022 Prabha SC +7 more
europepmc +1 more source
On the maximum atom-bond sum-connectivity index of unicyclic graphs with given diameter
AIMS MathematicsLet $ G = (V(G), E(G)) $ be a simple connected graph with vertex set $ V(G) $ and edge set $ E(G) $. The atom-bond sum-connectivity (ABS) index was proposed recently and is defined as $ ABS(G) = \sum_{uv\in E(G)}\sqrt{\frac{d_{G}(u)+d_{G}(v)-2}{d_{G}(u ...
Zhen Wang, Kai Zhou
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