Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Gaixiang Cai"'
Publikováno v:
Frontiers in Computational Neuroscience, Vol 16 (2022)
Let G be a graph, and the number of components of G is denoted by c(G). Let t be a positive real number. A connected graph G is t-tough if tc(G − S) ≤ |S| for every vertex cut S of V(G). The toughness of G is the largest value of t for which G is
Externí odkaz:
https://doaj.org/article/0393751657f84542a128e5f7869e4334
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2021 (2021)
The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let ℬn denote the set of bicyclic graphs without common edges
Externí odkaz:
https://doaj.org/article/5366204bd9714371a09fbf2187cfef9a
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2016 (2016)
The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemical properties of organic compounds. The hyper-Wiener index WW(G) is defined as WW(G)=1/2∑u,v∈VGdGu,v+dG2u,v with the summation going over all pair
Externí odkaz:
https://doaj.org/article/8f91b756dcf74a36b53bbcee5adea446
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2014 (2014)
Let G be an undirected simple graph of order n. Let A(G) be the adjacency matrix of G, and let μ1(G)≤μ2(G)≤⋯≤μn(G) be its eigenvalues. The energy of G is defined as ℰ(G)=∑i=1n|μi(G)|. Denote by GBPT a bipartite graph. In this paper
Externí odkaz:
https://doaj.org/article/70475ea4ecf44d2ebc42932a99100574
Publikováno v:
Journal of Applied Mathematics, Vol 2014 (2014)
We establish some signless Laplacian spectral radius conditions for a graph to be Hamiltonian or traceable or Hamilton-connected.
Externí odkaz:
https://doaj.org/article/da33fe21c6e34fb483d0f3d51b7a0eb5
Publikováno v:
Discrete Dynamics in Nature and Society. 2016:1-5
The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemical properties of organic compounds. The hyper-Wiener indexWW(G)is defined asWW(G)=1/2∑u,v∈VGdGu,v+dG2u,vwith the summation going over all pairs of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97add9e5c16bacc78f25b889388fe339
https://doi.org/10.1155/2016/7241349
https://doi.org/10.1155/2016/7241349
Publikováno v:
Applied Mathematics-A Journal of Chinese Universities. 29:241-248
Let G be a simple graph and let Q (G) be the signless Laplacian matrix of G. In this paper we obtain some results on the spectral perturbation of the matrix Q (G) under an edge addition or an edge contraction.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::942408e09953276df294ac1d47e7df85
https://doi.org/10.1007/s11766-014-3155-9
https://doi.org/10.1007/s11766-014-3155-9
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 39, Iss 4, Pp 951-974 (2019)
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or its complem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2cf5819ed1d6050d23f08a2378633e1e
https://doi.org/10.7151/dmgt.2119
https://doi.org/10.7151/dmgt.2119
Publikováno v:
J. Appl. Math.
Journal of Applied Mathematics, Vol 2014 (2014)
Journal of Applied Mathematics, Vol 2014 (2014)
We establish some signless Laplacian spectral radius conditions for a graph to be Hamiltonian or traceable or Hamilton-connected.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::72078c99cceae2bb608902b256fb6a3a
https://projecteuclid.org/euclid.jam/1425305863
https://projecteuclid.org/euclid.jam/1425305863
Publikováno v:
Discrete Dynamics in Nature and Society, Vol 2014 (2014)
LetGbe an undirected simple graph of ordern. LetA(G)be the adjacency matrix ofG, and letμ1(G)≤μ2(G)≤⋯≤μn(G)be its eigenvalues. The energy ofGis defined asℰ(G)=∑i=1n|μi(G)|. Denote byGBPTa bipartite graph. In this paper, we establis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a53f5c34d71464c4c80e69ec8e22072