Results 41 to 50 of about 963 (204)
The Aα-spectral radius of complements of bicyclic and tricyclic graphs with n vertices
Recently, the extremal problem of the spectral radius in the class of complements of trees, unicyclic graphs, bicyclic graphs and tricyclic graphs had been studied widely.
Chen Chaohui +2 more
doaj +1 more source
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 ...
openaire +3 more sources
All unicyclic graphs of order n with locating-chromatic number n-3
Characterizing all graphs having a certain locating-chromatic number is not an easy task. In this paper, we are going to pay attention on finding all unicyclic graphs of order n (⩾ 6) and having locating-chromatic number n-3.
Edy Tri Baskoro, Arfin Arfin
doaj +1 more source
On the Maximum Sombor Index of Unicyclic Graphs with a Fixed Girth
Let G be a graph having the set of edges EG. Represent by dGu the degree of a vertex u of G. The Sombor (SO) index of G is defined as SOG=∑uv∈EGdGu2+dGv2. The length of a shortest cycle in a graph G is known as the girth of G.
B. Senthilkumar +5 more
doaj +1 more source
The Laplacian spread of unicyclic graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan-Hong Bao +2 more
openaire +1 more source
Ordering graphs with large eccentricity-based topological indices
For a connected graph, the first Zagreb eccentricity index ξ 1 $\xi _{1}$ is defined as the sum of the squares of the eccentricities of all vertices, and the second Zagreb eccentricity index ξ 2 $\xi _{2}$ is defined as the sum of the products of the ...
Yunfang Tang, Xuli Qi
doaj +1 more source
Ordering of minimal energies in unicyclic signed graphs [PDF]
Let S = (G, σ) be a signed graph of order n and size m and let t1, t2, . . . , tn be the eigenvalues of S. The energy of S is defined as E(S) = Pnj=1|tj|. A connected signed graph is said to be unicyclic if its order and size are same.
Shamsher, Tahir +3 more
core +1 more source
On Minimum Wiener Polarity Index of Unicyclic Graphs with Prescribed Maximum Degree
The Wiener polarity index of a connected graph G is defined as the number of its pairs of vertices that are at distance three. By introducing some graph transformations, in different way with that of Huang et al., 2013, we determine the minimum Wiener ...
Jianping Ou, Xing Feng, Saihua Liu
doaj +1 more source
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source
The Laplacian Spectral Radius of a Class of Unicyclic Graphs
Let C(n,k) be the set of all unicyclic graphs with n vertices and cycle length k. For any U∈C(n,k), U consists of the (unique) cycle (say Ck) of length k and a certain number of trees attached to the vertices of Ck having (in total) n-k edges.
Haixia Zhang
doaj +1 more source

