Results 31 to 40 of about 305 (179)
Extremal Unicyclic Graphs With Minimal Distance Spectral Radius
Discussiones Mathematicae Graph Theory, 2014 The distance spectral radius ρ(G) of a graph G is the largest eigenvalue of the distance matrix D(G). Let U (n,m) be the class of unicyclic graphs of order n with given matching number m (m ≠ 3).
Lu Hongyan, Luo Jing, Zhu Zhongxun
doaj +1 more source
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 +1 more source
Identifying the Exact Value of the Metric Dimension and Edge Dimension of Unicyclic Graphs
Mathematics, 2022 Given a simple connected graph G, the metric dimension dim(G) (and edge metric dimension edim(G)) is defined as the cardinality of a smallest vertex subset S⊆V(G) for which every two distinct vertices (and edges) in G have distinct distances to a vertex ...
Enqiang Zhu +2 more
doaj +1 more source
Some Results on the Independence Polynomial of Unicyclic Graphs
Discussiones Mathematicae Graph Theory, 2018 Let G be a simple graph on n vertices. An independent set in a graph is a set of pairwise non-adjacent vertices. The independence polynomial of G is the polynomial I(G,x)=∑k=0ns(G,k)xk$I(G,x) = \sum\nolimits_{k = 0}^n {s\left({G,k} \right)x^k }$, where s(
Oboudi Mohammad Reza
doaj +1 more source
Restrained domination in unicyclic graphs
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 +1 more source
AKCE International Journal of Graphs and Combinatorics, 2023 For a connected simple graph G, the inverse degree index and forgotten index are defined as [Formula: see text] and [Formula: see text] respectively, where [Formula: see text] denotes the degree of vertex u in G.
Mohammad Ali Manian +2 more
doaj +1 more source
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 +1 more source
Unicyclic graphs with equal Laplacian energy [PDF]
Linear and Multilinear Algebra, 2013 11 pages, 11 figures, slightly modified version of Theorem 1 when compared with original ...
Eliseu Fritscher +2 more
openaire +2 more sources
On Minimum Wiener Polarity Index of Unicyclic Graphs with Prescribed Maximum Degree
Journal of Applied Mathematics, 2014 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
A survey and a new class of graceful unicylic graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A graph G admits a graceful labeling if there is a one-to-one map f from the set of vertices of G to such that when an edge xy is assigned the label the resulting set of edge labels is When such a labeling exists, G is called graceful. Rosa showed that a
Max Pambe Biatch’ +2 more
doaj +1 more source