Results 11 to 20 of about 412,655 (203)
Unicyclic Graphs with the Fourth Extremal Wiener Indices
Journal of Chemistry, 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
doaj +2 more sources
On the nullity of unicyclic graphs [PDF]
Linear Algebra and its Applications, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xuezhong, Tan, Liu, Bolian
openaire +2 more sources
On Variable Sum Exdeg Indices of Quasi-Tree Graphs and Unicyclic Graphs
Discrete Dynamics in Nature and Society, 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 ...
Xiaoling Sun, Jianwei Du
doaj +2 more sources
Further Results on the Resistance-Harary Index of Unicyclic Graphs
Mathematics, 2019 The Resistance-Harary index of a connected graph G is defined as R H ( G ) = ∑ { u , v } ⊆ V ( G ) 1 r ( u , v ) , where r ( u , v ) is the resistance distance between vertices u and v in G.
Jian Lu +4 more
doaj +2 more sources
Computing the vertex separation of unicyclic graphs [PDF]
Information and Computation, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John A. Ellis, Minko Markov
openaire +3 more sources
Restrained domination in unicyclic graphs [PDF]
Discussiones Mathematicae Graph Theory, 2009 Let G = (V,E) be a graph. A set S ⊆ V is a restrained dominating set if every vertex in V − S is adjacent to a vertex in S and to a vertex in V − S. The restrained domination number of G, denoted by γr(G), is the minimum cardinality of a restrained dominating set of G. A unicyclic graph is a connected graph that contains precisely one cycle.
Johannes H. Hattingh +4 more
openaire +2 more sources
The Second Maximum Mostar Index of Unicyclic Graphs With Given Diameter
Journal of MathematicsTopological invariants are key tools for studying the physicochemical and thermodynamic properties of chemical compounds. Recently, a new bond-additive distance-based graph invariant called the Mostar index has been developed.
Muhammad Amer Qureshi +4 more
doaj +2 more sources
On Unicyclic Graphs Spectra: New Results
2016 IEEE Intl Conference on Computational Science and Engineering (CSE) and IEEE Intl Conference on Embedded and Ubiquitous Computing (EUC) and 15th Intl Symposium on Distributed Computing and Applications for Business Engineering (DCABES), 2016 Let G = (V, E) be a unicyclic simple undirected graph. In this paper, we investigate the spectra of a particular class of unicyclic graphs G(q, n1) where q is the size of the unique cycle. Each vertex of the unique cycle is attached to n1 vertices. We provide the " exact values " of the extremal eigenvalues of the adjacency matrix A and the Laplacian ...
Hadji, Makhlouf, Chau, Ming
openaire +3 more sources
Extremal Permanents of Laplacian Matrices of Unicyclic Graphs
AxiomsThe extremal problem of Laplacian permanents of graphs is a classical and challenging topic in algebraic combinatorics, where the inherent #P-complete complexity of permanent computation renders this pursuit particularly intractable.
Tingzeng Wu +2 more
doaj +2 more sources
Stable and semi-stable unicyclic graphs [PDF]
Discrete Mathematics, 1974 AbstractWe show by a constructive proof, that if a unicyclic graph has a transposition in its automorphism group, then it is stable. Using a similar technique, we also determine which unicyclic graphs are not semi-stable.
K. L. McAvaney +2 more
openaire +4 more sources