Results 121 to 130 of about 963 (204)

Reconstructing edge-deleted unicyclic graphs

CoRR
The Harary reconstruction conjecture states that any graph with more than four edges can be uniquely reconstructed from its set of maximal edge-deleted subgraphs. In 1977, Müller verified the conjecture for graphs with $n$ vertices and $n \log_2(n)$ edges, improving on Lovás's bound of $\log(n^2-n)/4$.
Anthony E. Pizzimenti, Umarkhon Rakhimov
openaire   +2 more sources

Laplacian eigenvalue distribution for unicyclic graphs

Applied Mathematics and Computation
Let $G$ be a unicyclic graph. In this paper, we provide an upper bound for the number of Laplacian eigenvalues of $G$ within the interval $[0,1)$ in terms of the diameter and the girth of $G$.
Sunyo Moon, Seungkook Park
openaire   +3 more sources

Zonal Labeling of Graphs

Indonesian Journal of Combinatorics
A planar graph is said to be zonal when is possible to label its vertices with the nonzero elements of ℤ3, in such a way that the sum of the labels of the vertices on the boundary of each zone is 0 in ℤ3.
Christian Barrientos, Sarah Minion
doaj   +1 more source

Hosoya Polynomials of Power Graphs of Certain Finite Groups. [PDF]

Molecules, 2022
Rather BA, Ali F, Alsaeed S, Naeem M.
europepmc   +1 more source

On the signless Laplacian coefficients of unicyclic graphs

, 2013
Let G be a graph of order n and let View the MathML source be the characteristic polynomial of the signless Laplacian of G. Let Eg,n (respectively, Cg(Sn−g+1)) denote the unicyclic graph of order n obtained by a coalescence of a vertex in the cycle Cg ...
譚必信, Tam, B.-S., Li, Hong-Hai; Tam, Bit-Shun; Li Su   +2 more
core   +1 more source

ON THE SECOND LARGEST SPECTRAL RADIUS OF UNICYCLIC BIPARTITE GRAPHS

, 2011
In this paper, we determine the two graphs in the class of unicyclic bipartite graphs with n vertices, having the first two largest spectral radius.
MILAN NATH
core   +1 more source

The inertia of unicyclic graphs and bicyclic graphs

Discussiones Mathematicae - General Algebra and Applications, 2013
Let G be a graph with n vertices and (G) be the matching number of G. The inertia of a graph G, In(G) = (n+;n ;n0) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let (G) = n0 denote the nullity of G (the multiplicity of the eigenvalue zero of G).
openaire   +1 more source

Spectral properties of a class of unicyclic graphs. [PDF]

J Inequal Appl, 2017
Du Z.
europepmc   +1 more source

On Hamiltonian Decomposition Problem of 3-Arc Graphs. [PDF]

Comput Intell Neurosci, 2022
Xu G, Sun Q, Liang Z.
europepmc   +1 more source

Unicyclic graphs with metric dimension 2

, 2015
Some families of unicyclic graphs with metric dimension 2 are characterized.Охарактеризовано певнi родини унiциклiчних графiв, що мають метричну розмiрнiсть ...
Дуденко, Маргарита
core