Results 31 to 40 of about 2,448,104 (66)
Some results on the Laplacian eigenvalues of unicyclic graphs
, 2009 In this paper, we provide the smallest value of the second largest Laplacian eigenvalue for any unicyclic graph, and find the unicyclic graphs attaining that value.
Li, Jianxi +2 more
core +1 more source
Unicyclic Graphs with the Fourth Extremal Wiener Indices
, 2020 A graph is called unicyclic if the graph contains exactly one cycle. Unicyclic graphs with the fourth extremal Wiener indices are characterized. It is shown that, among all unicyclic graphs with n≥8 vertices, C5Sn−4 and C2u1,u2S3,Sn−4 attain the fourth ...
Guangfu Wang +3 more
core +1 more source
Certain Aspects of Spectra of Unicyclic Graphs [PDF]
, 2006 Supervisor: Bhaba Kr. SarmaThis thesis aims at filling some conspicuous gaps in the study of spectra of unicyclic graphs, and answering some recent questions on relations between the structure of a unicyclic graph and the spectrum of its adjacency matrix.
Nath, Milan
core +1 more source
Independent Dominating Sets in Unicyclic Graphs [PDF]
, 2022 Wilf found the maximum number of independent dominating sets of a tree using algebraic methods, while Sagan gave an elementary proof. In this thesis, we maximize the number of independent dominating sets of unicyclic graphs, giving a new proof of a ...
Lopez, Rachel
core
On bipartite graphs with minimal energy
, 2009 The energy of a graph is the sum of the absolute values of the eigenvalues of the graph. In a paper [G. Caporossi, D. Cvetkovi, I. Gutman, P. Hansen, Variable neighborhood search for extremal graphs. 2. Finding graphs with external energy, J. Chem.
Li, Xueliang +2 more
core +1 more source
On bipartite (1,1,k)-mixed graphs [PDF]
The degree/diameter problem consists of finding the graph (or graphs) with the largest possible number of vertices, given a maximum degree and a diameter. This famous problem was extended to digraphs and mixed graphs. Mixed graphs can be seen as digraphs
Dalfó, Cristina +5 more
core +1 more source
Independence and matching numbers of unicyclic graphs from null space [PDF]
, 2020 We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its subtrees ...
Molina, Gonzalo +4 more
core +1 more source
Unicyclic graphs with metric dimension 2 [PDF]
, 2015 Some families of unicyclic graphs with metric dimension 2 are characterized.Охарактеризовано певнi родини унiциклiчних графiв, що мають метричну розмiрнiсть ...
Дуденко, Маргарита
core
On Variable Sum Exdeg Indices of Quasi-Tree Graphs and Unicyclic Graphs
, 2020 In this work, by using the properties of the variable sum exdeg indices and analyzing the structure of the quasi-tree graphs and unicyclic graphs, the minimum and maximum variable sum exdeg indices of quasi-tree graphs and quasi-tree graphs with perfect ...
Jianwei Du, Xiaoling Sun
core +1 more source
On bipartite $(1,1,k)$-mixed graphs [PDF]
Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one.
Tuite, J. +4 more
core