Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number

Xiuwen Yang, Hajo Broersma*, Ligong Wang

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

12 Downloads (Pure)

Abstract

The eccentricity matrix ɛ(G) of a strongly connected digraph G is defined as ɛ(G)ij=d(vi,vj),ifd(vi,vj)=min{e+(vi),e(vj)},0,otherwise.,where e+(vi)=max{d(vi,vj)∣vj∈V(G)} is the out-eccentricity of the vertex vi of G, and e(vj)=max{d(vi,vj)∣vi∈V(G)} is the in-eccentricity of the vertex vj of G. The eigenvalue of ɛ(G) with the largest modulus is called the eccentricity spectral radius of G. In this paper, we obtain lower bounds for the eccentricity spectral radius among all join digraphs with a fixed dichromatic number. We also give upper bounds for the eccentricity spectral radius of some special join digraphs with a fixed dichromatic number.

Original languageEnglish
Pages (from-to)241-257
Number of pages17
JournalDiscrete applied mathematics
Volume357
DOIs
Publication statusPublished - 15 Nov 2024

Keywords

  • UT-Hybrid-D
  • Eccentricity matrix
  • Spectral radius
  • Dichromatic number

Fingerprint

Dive into the research topics of 'Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number'. Together they form a unique fingerprint.

Cite this