Chain graph sequences and Laplacian spectra of chain graphs

Abdullah Alazemi; Milica Anđelić; Kinkar Chandra Das; Carlos M. da Fonseca

doi:10.1080/03081087.2022.2036672

Chain graph sequences and Laplacian spectra of chain graphs

Abdullah Alazemi
, Milica Anđelić
, Kinkar Chandra Das
, Carlos M. da Fonseca

Department of Mathematics

Kuwait University
Kuwait College of Science and Technology
University of Deusto

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

14 Scopus citations

Abstract

A graph is called a chain graph if it is bipartite and the neighbourhoods of the vertices in each colour class form a chain with respect to inclusion. In this paper, we study the relation between the degree sequences and the Laplacian spectra of chain graphs. We provide explicit formulae for the Laplacian characteristic polynomial of a chain graph, and certain properties of the Laplacian spectrum that can be deduced from its degree sequence.

Original language	English
Pages (from-to)	569-585
Number of pages	17
Journal	Linear and Multilinear Algebra
Volume	71
Issue number	4
DOIs	https://doi.org/10.1080/03081087.2022.2036672
State	Published - 2023

Keywords

chain graphs
graphic sequences
Laplacian spectrum
tridiagonal matrices
Yields

Access to Document

10.1080/03081087.2022.2036672

Cite this

@article{3673d43725bd4046899df3d88fc0e689,

title = "Chain graph sequences and Laplacian spectra of chain graphs",

abstract = "A graph is called a chain graph if it is bipartite and the neighbourhoods of the vertices in each colour class form a chain with respect to inclusion. In this paper, we study the relation between the degree sequences and the Laplacian spectra of chain graphs. We provide explicit formulae for the Laplacian characteristic polynomial of a chain graph, and certain properties of the Laplacian spectrum that can be deduced from its degree sequence.",

keywords = "chain graphs, graphic sequences, Laplacian spectrum, tridiagonal matrices, Yields",

author = "Abdullah Alazemi and Milica An{\d}eli{\'c} and Das, \{Kinkar Chandra\} and \{da Fonseca\}, \{Carlos M.\}",

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

year = "2023",

doi = "10.1080/03081087.2022.2036672",

language = "English",

volume = "71",

pages = "569--585",

journal = "Linear and Multilinear Algebra",

issn = "0308-1087",

publisher = "Taylor and Francis Ltd.",

number = "4",

}

TY - JOUR

T1 - Chain graph sequences and Laplacian spectra of chain graphs

AU - Alazemi, Abdullah

AU - Anđelić, Milica

AU - Das, Kinkar Chandra

AU - da Fonseca, Carlos M.

PY - 2023

Y1 - 2023

N2 - A graph is called a chain graph if it is bipartite and the neighbourhoods of the vertices in each colour class form a chain with respect to inclusion. In this paper, we study the relation between the degree sequences and the Laplacian spectra of chain graphs. We provide explicit formulae for the Laplacian characteristic polynomial of a chain graph, and certain properties of the Laplacian spectrum that can be deduced from its degree sequence.

AB - A graph is called a chain graph if it is bipartite and the neighbourhoods of the vertices in each colour class form a chain with respect to inclusion. In this paper, we study the relation between the degree sequences and the Laplacian spectra of chain graphs. We provide explicit formulae for the Laplacian characteristic polynomial of a chain graph, and certain properties of the Laplacian spectrum that can be deduced from its degree sequence.

KW - chain graphs

KW - graphic sequences

KW - Laplacian spectrum

KW - tridiagonal matrices

KW - Yields

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

U2 - 10.1080/03081087.2022.2036672

DO - 10.1080/03081087.2022.2036672

M3 - Article

AN - SCOPUS:85124845499

SN - 0308-1087

VL - 71

SP - 569

EP - 585

JO - Linear and Multilinear Algebra

JF - Linear and Multilinear Algebra

IS - 4

ER -

Chain graph sequences and Laplacian spectra of chain graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this