Distance between distance spectra of graphs

Huiqiu Lin; Dan Li; Kinkar Ch Das

doi:10.1080/03081087.2017.1278737

Distance between distance spectra of graphs

Huiqiu Lin, Dan Li, Kinkar Ch Das

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

Abstract

Let G = (V, E) be a connected graph with vertex set V(G) = {v1, v2, . . . , vn} and edge set E(G). Let D(G) be the distance matrix of G and λ₁ (D) ≥ ... ≥ λ_n be its distance spectrum. The distance between distance spectra of G and (Formula presented.) is defined by (Formula presented.) Define the cospectrality of G by (Formula presented.) Let cs_n = max{cs(G) : G. In the paper, we obtain lower bounds on σ (G, K_n) and σ(G, K_a,b) for a+b = n. Furthermore, we give an upper bound on cs_n.

Original language	English
Pages (from-to)	2538-2550
Number of pages	13
Journal	Linear and Multilinear Algebra
Volume	65
Issue number	12
DOIs	https://doi.org/10.1080/03081087.2017.1278737
State	Published - 2 Dec 2017

Keywords

05C50
cospectral
distance
distance matrix
Distance spectra

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1080/03081087.2017.1278737

Cite this

@article{98945ff2e17e42239275ea68f489d735,

title = "Distance between distance spectra of graphs",

abstract = "Let G = (V, E) be a connected graph with vertex set V(G) = \{v1, v2, . . . , vn\} and edge set E(G). Let D(G) be the distance matrix of G and λ1 (D) ≥ ... ≥ λn be its distance spectrum. The distance between distance spectra of G and (Formula presented.) is defined by (Formula presented.) Define the cospectrality of G by (Formula presented.) Let csn = max\{cs(G) : G. In the paper, we obtain lower bounds on σ (G, Kn) and σ(G, Ka,b) for a+b = n. Furthermore, we give an upper bound on csn.",

keywords = "05C50, cospectral, distance, distance matrix, Distance spectra",

author = "Huiqiu Lin and Dan Li and Das, \{Kinkar Ch\}",

note = "Publisher Copyright: {\textcopyright} 2017 Informa UK Limited, trading as Taylor \& Francis Group.",

year = "2017",

month = dec,

day = "2",

doi = "10.1080/03081087.2017.1278737",

language = "English",

volume = "65",

pages = "2538--2550",

journal = "Linear and Multilinear Algebra",

issn = "0308-1087",

publisher = "Taylor and Francis Ltd.",

number = "12",

}

TY - JOUR

T1 - Distance between distance spectra of graphs

AU - Lin, Huiqiu

AU - Li, Dan

AU - Das, Kinkar Ch

PY - 2017/12/2

Y1 - 2017/12/2

N2 - Let G = (V, E) be a connected graph with vertex set V(G) = {v1, v2, . . . , vn} and edge set E(G). Let D(G) be the distance matrix of G and λ1 (D) ≥ ... ≥ λn be its distance spectrum. The distance between distance spectra of G and (Formula presented.) is defined by (Formula presented.) Define the cospectrality of G by (Formula presented.) Let csn = max{cs(G) : G. In the paper, we obtain lower bounds on σ (G, Kn) and σ(G, Ka,b) for a+b = n. Furthermore, we give an upper bound on csn.

AB - Let G = (V, E) be a connected graph with vertex set V(G) = {v1, v2, . . . , vn} and edge set E(G). Let D(G) be the distance matrix of G and λ1 (D) ≥ ... ≥ λn be its distance spectrum. The distance between distance spectra of G and (Formula presented.) is defined by (Formula presented.) Define the cospectrality of G by (Formula presented.) Let csn = max{cs(G) : G. In the paper, we obtain lower bounds on σ (G, Kn) and σ(G, Ka,b) for a+b = n. Furthermore, we give an upper bound on csn.

KW - 05C50

KW - cospectral

KW - distance

KW - distance matrix

KW - Distance spectra

UR - https://www.scopus.com/pages/publications/85009446786

U2 - 10.1080/03081087.2017.1278737

DO - 10.1080/03081087.2017.1278737

M3 - Article

AN - SCOPUS:85009446786

SN - 0308-1087

VL - 65

SP - 2538

EP - 2550

JO - Linear and Multilinear Algebra

JF - Linear and Multilinear Algebra

IS - 12

ER -

Distance between distance spectra of graphs

Abstract

Keywords

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this