Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Z Jonnathan Rodríguez"'
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Let $\mathcal{G}$ be a simple undirected connected graph. The signless Laplacian Estrada, Laplacian Estrada and Estrada indices of a graph $\mathcal{G}$ is the sum of the exponentials of the signless Laplacian eigenvalues, Laplacian eigenvalues and e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4aeb117304d4b0e3e3db412eab7b849
https://doi.org/10.1016/j.laa.2019.10.029
https://doi.org/10.1016/j.laa.2019.10.029
Publikováno v:
Linear Algebra and its Applications. 545:15-31
For an undirected simple graph G, the line graph L ( G ) is the graph whose vertex set is in one-to-one correspondence with the edge set of G where two vertices are adjacent if their corresponding edges in G have a common vertex. The energy E ( G ) i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d372433572f7f39f36e6e96efb837c90
https://doi.org/10.1016/j.laa.2018.01.025
https://doi.org/10.1016/j.laa.2018.01.025
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
In this paper we explore some results concerning the spread of the line and the total graph of a given graph. In particular, it is proved that for an $(n,m)$ connected graph $G$ with $m > n \geq 4$ the spread of $G$ is less than or equal to the sprea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a2e997c01ceaf024027b8fb5ec1f28e
http://hdl.handle.net/10773/26232
http://hdl.handle.net/10773/26232
