Results 81 to 90 of about 314 (174)
Factorizations of complete graphs into tadpoles
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
On the global offensive alliance in unicycle graphs
11 pages, 1 ...
Mohamed Bouzefrane, Saliha Ouatiki
openaire +4 more sources
Spectrum of Unicyclic Graph [PDF]
Agung Lukito +3 more
openaire +1 more source
The number of independent sets in unicyclic graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pedersen, Anders Sune +1 more
openaire +4 more sources
Unicyclic signed graphs with minimal energy
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mushtaq A. Bhat, Shariefuddin Pirzada
openaire +3 more sources
Ordering Unicyclic Graphs in Terms of Their Smaller Least Eigenvalues
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
The Connected Detour Numbers of Special Classes of Connected Graphs
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
Solutions of Detour Distance Graph Equations. [PDF]
Prabha SC +7 more
europepmc +1 more source
Maximum Laplacian energy of unicyclic graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Chandra Das +3 more
openaire +2 more sources
A structural approach to the graceful coloring of a subclass of trees. [PDF]
D L, S DY.
europepmc +1 more source

