Some bounds on the distance-sum-connectivity matrix

The distance-sum-connectivity matrix of a graph G is expressed by [Formula: see text] and [Formula: see text] such that [Formula: see text] . [Formula: see text] and [Formula: see text] are represented by a sum of the distance matrices for [Formula: see text] and [Formula: see text] , respectively....

Descripción completa

Detalles Bibliográficos
Autor principal: Gök, Gülistan Kaya
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2018
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6061528/
https://www.ncbi.nlm.nih.gov/pubmed/30137899
http://dx.doi.org/10.1186/s13660-018-1766-z
Descripción
Sumario:The distance-sum-connectivity matrix of a graph G is expressed by [Formula: see text] and [Formula: see text] such that [Formula: see text] . [Formula: see text] and [Formula: see text] are represented by a sum of the distance matrices for [Formula: see text] and [Formula: see text] , respectively. The purpose of this paper is to give new inequalities involving the eigenvalues, the graph energy, the graph incidence energy, and the matching energy. So, we have some results in terms of the edges, the vertices, and the degrees.

Ejemplares similares