Results 11 to 20 of about 891,390 (207)
Unicyclic Components in Random Graphs [PDF]
The distribution of unicyclic components in a random graph is obtained analytically. The number of unicyclic components of a given size approaches a self-similar form in the vicinity of the gelation transition.
Aldous D J +25 more
core +2 more sources
Unicyclic Graphs with equal Laplacian Energy [PDF]
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
Extremal Values on the General Degree–Eccentricity Index of Unicyclic Graphs of Fixed Diameter
For a connected graph G and two real numbers a,b, the general degree–eccentricity index of G is given by DEIa,bG=∑v∈VGdGavecGbv, where VG represent the vertex set of graph G, dGv denotes the degree of vertex v, and ecGv is the eccentricity of v in G ...
Mesfin Masre
doaj +2 more sources
Spectrum of Unicyclic Graph [PDF]
Budi Rahadjeng +3 more
semanticscholar +2 more sources
Online Graph Exploration on Trees, Unicyclic Graphs and Cactus Graphs [PDF]
We study the problem of exploring all vertices of an undirected weighted graph that is initially unknown to the searcher. An edge of the graph is only revealed when the searcher visits one of its endpoints. Beginning at some start node, the searcher's goal is to visit every vertex of the graph before returning to the start node on a tour as short as ...
Robin Fritsch
semanticscholar +5 more sources
Burning Numbers of t-unicyclic Graphs [PDF]
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
Null decomposition of unicyclic graphs [PDF]
arXiv admin note: text overlap with arXiv:1907 ...
L. Emilio Allem +4 more
openaire +2 more sources
The Signless Laplacian Estrada Index of Unicyclic Graphs [PDF]
For a simple graph G, the signless Laplacian Estrada index is defined as SLEE(G)=∑ni=1eqi, where q1, q2,..., qn are the eigenvalues of the signless Laplacian matrix of G.
Hamid Reza Ellahi +3 more
doaj +1 more source
This research discussed the characteristic polynomial and eigenvalues of antiadjacency matrix of directed unicyclic flower vase graph. The entries of the antiadjacency matrix of a directed graph represent the presence or the absence of a directed arc ...
Bayu H. Aji, K. Sugeng, S. Aminah
semanticscholar +1 more source
A directed graph can be represented by several matrix representations, such as the anti-adjacency matrix. This paper discusses the general form of characteristic polynomial and eigenvaluesof the anti-adjacencymatrix of directed unicyclic corona graph ...
N. Hasyyati, K. Sugeng, S. Aminah
semanticscholar +1 more source

