Results 51 to 60 of about 891,390 (207)
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
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
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
Spectral radius and extremal graphs for class of unicyclic graph with pendant vertices
, 2017 In this article, we research on the spectral radius of extremal graphs for the unicyclic graphs with girth g mainly by the graft transformation and matching and obtain the upper bounds of the spectral radius of unicyclic graphs.
LÜ Zhi +5 more
semanticscholar +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
Maximizing spectral radii of uniform hypergraphs with few edges
, 2015 In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs ...
Fan, Yi-Zheng +3 more
core +1 more source
An improved upper bound for the online graph exploration problem on unicyclic graphs
Journal of combinatorial optimizationThe online graph exploration problem, which was proposed by Kalyanasundaram and Pruhs (Theor Comput Sci 130(1):125–138, 1994), is defined as follows: Given an edge-weighted undirected connected graph and a specified vertex (called the origin), the task ...
Koji M. Kobayashi, Ying Li
semanticscholar +1 more source
A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs
, 2017 The \emph{metric dimension} $\dim(G)$ of a graph $G$ is the minimum number of vertices such that every vertex of $G$ is uniquely determined by its vector of distances to the chosen vertices.
Eroh, Linda, Kang, Cong X., Yi, Eunjeong
core +1 more source
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
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