Results 101 to 110 of about 963 (204)
The smallest values of algebraic connectivity for unicyclic graphs
, 2010 The algebraic connectivity of G is the second smallest eigenvalue of its Laplacian matrix. Let Un be the set of all unicyclic graphs of order n. In this paper, we will provide the ordering of unicyclic graphs in Un up to the last seven graphs according ...
Jianxi Li +5 more
core +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
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
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
Factorizations of complete graphs into tadpoles
AKCE International Journal of Graphs and Combinatorics, 2020 A tadpole (also a canoe paddle or lollipop) is a graph that arises from a cycle and a path by gluing a terminal vertex of the path to an arbitrary vertex of the cycle.
Michael Kubesa, Tom Raiman
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 nullity and the matching number of unicyclic graphs
, 2009 Let G be a graph with n vertices and ν(G) be the matching number of G. Let η(G) denote the nullity of G (the multiplicity of the eigenvalue zero of G). It is well known that if G is a tree, then η(G)=n-2ν(G). Tan and Liu [X. Tan, B.
Yan, Weigen +2 more
core +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
The largest n - 1 Hosoya indices of unicyclic graphs
, 2016 The Hosoya index Z(G) of a graph G is defined as the total number of edge independent sets of G. In this paper, we extend the research of [J. Ou, On extremal unicyclic molecular graphs with maximal Hosoya index, Discrete Appl. Math.
Guihai Yu, Aleksandar Ilic, Lihua Feng
core +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