2018
DOI: 10.1016/j.dam.2018.05.062
|View full text |Cite
|
Sign up to set email alerts
|

The anti-adjacency matrix of a graph: Eccentricity matrix

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
44
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 56 publications
(44 citation statements)
references
References 11 publications
0
44
0
Order By: Relevance
“…Let D (G) = (d uv ) be the distance matrix of G, where d uv = d G (u, v). In [11] Wang defined the eccentricity of matrix ε (G) from distance matrix as D(G) as:…”
Section: Introductionmentioning
confidence: 99%
“…Let D (G) = (d uv ) be the distance matrix of G, where d uv = d G (u, v). In [11] Wang defined the eccentricity of matrix ε (G) from distance matrix as D(G) as:…”
Section: Introductionmentioning
confidence: 99%
“…Similar energies got from the eigenvalues of various graphs are considered in recent times. Several other authors also investigated energy of graph [1,2,7,10,11,13].…”
Section: Introductionmentioning
confidence: 99%
“…For more details see [1], [2] and the reference cited there in. Irreducibility of the polynomial of eccentricity-matrix of a tree is spoken by JianfengWang [5] and energy of a graph is spoken in Gutman [4]. I combined these two concepts and put forth the concept of eccentricity energy of graphs.…”
Section: Introductionmentioning
confidence: 99%