Results 81 to 90 of about 298 (175)
On the core of a unicyclic graph
Ars Mathematica Contemporanea, 2012 8 pages, 5 ...
Levit, Vadim E., Mandrescu, Eugen
openaire +3 more sources
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
, 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 Connected Detour Numbers of Special Classes of Connected Graphs
Journal of Mathematics, 2019 Simple finite connected graphs G=V,E of p≥2 vertices are considered in this paper. A connected detour set of G is defined as a subset S⊆V such that the induced subgraph GS is connected and every vertex of G lies on a u−v detour for some u,v∈S.
Ahmed M. Ali, Ali A. Ali
doaj +1 more source
Ordering Unicyclic Graphs in Terms of Their Smaller Least Eigenvalues
Journal of Inequalities and Applications, 2010 Let be a simple graph with vertices, and let be the least eigenvalue of . The connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs.
Xu Guang-Hui
doaj
Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges
Electronic Journal of Graph Theory and Applications, 2019 We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necesary conditions are satisfied.
John Fahnenstiel, Dalibor Froncek
doaj +1 more source
Solutions of Detour Distance Graph Equations. [PDF]
Sensors (Basel), 2022 Prabha SC +7 more
europepmc +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
A note on the minimum reduced reciprocal Randic index of n-vertex unicyclic graphs
Kuwait Journal of Science, 2017 Recent studies show that the reduced reciprocal Randi? (RRR) index possesses the second-best correlating ability amongthe several well known topological indices.
Akbar Ali, Akhlaq A. Bhatti
doaj