Zobrazeno 1 - 10
of 128
pro vyhledávání: '"tricyclic graph"'
Publikováno v:
Mathematics Interdisciplinary Research, Vol 9, Iss 2, Pp 185-197 (2024)
Consider a simple, undirected graph $ G=(V,E)$, where $A$ represents the adjacency matrix and $Q$ represents the Laplacian matrix of $G$. The second smallest eigenvalue of Laplacian matrix of $G$ is called the algebraic connectiv
Externí odkaz:
https://doaj.org/article/5dae8c54c90d43058510a679a6eab331
Autor:
Xiao-Min Zhu, Xu Yang
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 1, Pp 65-72 (2023)
AbstractLet G be a simple connected graph and [Formula: see text] Let [Formula: see text] be the expected hitting time from x to y in G and [Formula: see text] be the hitting time of G, where [Formula: see text] A tricyclic graph is a simple connecte
Externí odkaz:
https://doaj.org/article/723f779e86f44537b4a271ac6b7d436a
Publikováno v:
Discrete Mathematics Letters, Vol 11, Pp 14-18 (2022)
Externí odkaz:
https://doaj.org/article/829ea7a852424bd7b74b4ebdcddac90a
Publikováno v:
Heliyon, Vol 9, Iss 5, Pp e15706- (2023)
The variable sum exdeg index, initially introduced by Vukicevic (2011) [20] for predicting the octanol water partition co-efficient of certain chemical compounds, is an invariant for a graph G and defined as SEIa(G)=∑v∈V(G)(dvadv), where dv is th
Externí odkaz:
https://doaj.org/article/1000a7cf2f764043bb32ae1e30cd3f26
Publikováno v:
Symmetry, Vol 15, Iss 11, p 2086 (2023)
The Randić index of a graph G is the sum of (dG(u)dG(v))−12 over all edges uv of G, where dG(u) denotes the degree of vertex u in G. In this paper, we investigate a few graph transformations that decrease the Randić index of a graph. By applying
Externí odkaz:
https://doaj.org/article/c80c6cd56b4a40ce971d310389133fc0
Autor:
Wenjing LI, Yanling SHAO
Publikováno v:
Journal of Hebei University of Science and Technology, Vol 41, Iss 4, Pp 334-340 (2020)
Aiming at the problem that there are many kinds of tricyclic graphs and the complexity of path matrix is high, the path energy of two kinds of tricyclic graphs with or without pendant vertices was studied by means of matrix analysis, the existence th
Externí odkaz:
https://doaj.org/article/ff4d028477fc4ed4a49441afc87e23b3
Autor:
Hongjuan JU, Yingjie LEI
Publikováno v:
Journal of Hebei University of Science and Technology, Vol 40, Iss 6, Pp 477-481 (2019)
In order to discuss the minimum eigenvalue of adjacency matrix in the class of complementary graphs of the tricyclic graph with a given order of n and n－4 pendent vertexes, the unique graph whose minimum eigenvalue reaches the minimum is characteri
Externí odkaz:
https://doaj.org/article/b3036a1f9f6f4993b9df681868d90922
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Hongyan Lu, Zhongxun Zhu
Publikováno v:
Frontiers in Physics, Vol 8 (2020)
With the wide application of graph theory in circuit layout, signal flow chart and power system, more and more attention has been paid to the network topology analysis method of graph theory. In this paper, we construct a graph transformation which c
Externí odkaz:
https://doaj.org/article/8b4e48001cc14b7391910c0a241f5f81
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 3, Pp 505-522 (2017)
Let φ(L(G))=det (xI−L(G))=∑k=0n(−1)kck(G)xn−k$\phi (L(G)) = \det (xI - L(G)) = \sum\nolimits_{k = 0}^n {( - 1)^k c_k (G)x^{n - k} } $ be the Laplacian characteristic polynomial of G. In this paper, we characterize the minimal graphs with th
Externí odkaz:
https://doaj.org/article/7c98a70f4cbd4b1eac6f012632163527