A note on the Q-integrability of complete bipartite graphs with self-loops

A graph [Formula: see text] is [Formula: see text]-integral if its signless Laplacian has only integral eigenvalues. Suppose [Formula: see text] be the graph after adding a self-loop to every vertex of a subset [Formula: see text] of [Formula: see text]. In this paper, we prove that for a nonempty proper subset [Formula: see text] of [Formula: see text], [Formula: see text] is [Formula: see text]-integral if and only if [Formula: see text] and self-loops are added in exactly two vertices of each partite set, or [Formula: see text] and self-loops are added to all the vertices of one partite set. Besides, we prove that if [Formula: see text] is a nonempty proper subset of [Formula: see text], then [Formula: see text] is [Formula: see text]-integral if and only if [Formula: see text] and self-loops are added to all the pendant vertices. Using these results, we also answer when the matrix [Formula: see text] have only integral spectrum, where [Formula: see text] is any [Formula: see text]-diagonal matrix and [Formula: see text] is permutation similar to either [Formula: see text] or [Formula: see text].

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2024-11-13
DOI
https://doi.org/10.1142/s1793830924501258
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A note on the Q-integrability of complete bipartite graphs with self-loops

Jesmina Pervin, Lavanya Selvaganesh
1 links
Discrete Mathematics Algorithms and Applications
graph theory and CDMA systems
article

A note on the Q-integrability of complete bipartite graphs with self-loops

Jesmina Pervin, Lavanya Selvaganesh
article en

Abstract

A graph [Formula: see text] is [Formula: see text]-integral if its signless Laplacian has only integral eigenvalues. Suppose [Formula: see text] be the graph after adding a self-loop to every vertex of a subset [Formula: see text] of [Formula: see text]. In this paper, we prove that for a nonempty proper subset [Formula: see text] of [Formula: see text], [Formula: see text] is [Formula: see text]-integral if and only if [Formula: see text] and self-loops are added in exactly two vertices of each partite set, or [Formula: see text] and self-loops are added to all the vertices of one partite set. Besides, we prove that if [Formula: see text] is a nonempty proper subset of [Formula: see text], then [Formula: see text] is [Formula: see text]-integral if and only if [Formula: see text] and self-loops are added to all the pendant vertices. Using these results, we also answer when the matrix [Formula: see text] have only integral spectrum, where [Formula: see text] is any [Formula: see text]-diagonal matrix and [Formula: see text] is permutation similar to either [Formula: see text] or [Formula: see text].

Discrete Mathematics Algorithms and ApplicationsVol. 17(08)
Indian Institute of Technology BHU (IN), Banaras Hindu University (IN)
Reduced inequalities
Openalex Percentile: Top 82%
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A note on the Q-integrability of complete bipartite graphs with self-loops — Jesmina Pervin, Lavanya Selvaganesh · Discrete Mathematics Algorithms and Applications (2024) | TGRS Research Map | TGRS