Results 1 to 10 of about 2,994 (168)
Unicyclic Graphs with equal Laplacian Energy [PDF]
Linear and Multilinear Algebra, 2013 We introduce a new operation on a class of graphs with the property that the Laplacian eigenvalues of the input and output graphs are related. Based on this operation, we obtain a family of order (square root of n) noncospectral unicyclic graphs on n ...
Fritscher, Eliseu +2 more
core +3 more sources
On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree [PDF]
Journal of Inequalities and Applications, 2017 In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum ...
Shu-Guang Guo, Rong Zhang
doaj +2 more sources
Regularity of the edge ideals of perfect [ν,h]-ary trees and some unicyclic graphs [PDF]
HeliyonWe compute the Castelnuovo-Mumford regularity of the quotient rings of edge ideals of perfect [ν,h]-ary trees and some unicyclic graphs.
Fatima Tul Zahra +2 more
doaj +2 more sources
Lower bounds on trees and unicyclic graphs with respect to the misbalance rodeg index [PDF]
HeliyonThe Misbalance Rodeg (MR) index stands out among the 148 discrete Adriatic indices demonstrating considerable predictive capabilities in evaluations carried out by the International Academy of Mathematical Chemistry.
Nasrin Dehgardi +2 more
doaj +2 more sources
Burning Numbers of t-unicyclic Graphs [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2021 Given a graph $G$, the burning number of $G$ is the smallest integer $k$ for which there are vertices $x_1, x_2,\ldots,x_k$ such that $(x_1,x_2,\ldots,x_k)$ is a burning sequence of $G$. It has been shown that the graph burning problem is NP-complete, even for trees with maximum degree three, or linear forests. A $t$-unicyclic graph is a unicycle graph
Ruiting Zhang, Yingying Yu, Huiqing Liu
openaire +3 more sources
Incidence and Laplacian matrices of wheel graphs and their inverses
The American Journal of Combinatorics, 2023 It has been an open problem to find the Moore-Penrose inverses of the incidence, Laplacian, and signless Laplacian matrices of families of graphs except trees and unicyclic graphs.
Jerad Ipsen, Sudipta Mallik
doaj +1 more source
Null decomposition of unicyclic graphs [PDF]
Discrete Applied Mathematics, 2020 arXiv admin note: text overlap with arXiv:1907 ...
L. Emilio Allem +4 more
openaire +2 more sources
Unicyclic components in random graphs [PDF]
Journal of Physics A: Mathematical and General, 2004 4 pages, 2 ...
Ben-Naim, E., Krapivsky, P. L.
openaire +2 more sources
New Diagonal Graph Ramsey Numbers of Unicyclic Graphs
Theory and Applications of Graphs, 2023 Grossman conjectured that R(G, G) = 2 · |V (G)| − 1, for all simple connected unicyclic graphs G of odd girth and |V (G)| ≥ 4. In this note, we prove his conjecture for various classes of G containing a triangle.
Richard M. Low, Ardak Kapbasov
doaj +1 more source
On symmetric division deg index of unicyclic graphs and bicyclic graphs with given matching number
AIMS Mathematics, 2021 Nowadays, it is an important task to find extremal values on any molecular descriptor with respect to different graph parameters. In a molecular graph, the vertices represent the atoms and the edges represent the chemical bonds in the terms of graph ...
Xiaoling Sun, Yubin Gao, Jianwei Du
doaj +1 more source