2022
DOI: 10.48550/arxiv.2202.05987
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Distance Laplacian eigenvalues of graphs and chromatic and independence number

Abstract: For a connected graph G of order n, let Diag(T r) be the diagonal matrix of vertex transmissions and D(G) be the distance matrix of G. The distance Laplacian matrix of G is

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 8 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?