Connected Q-integral graphs with maximum edge-degree less than or equal to 8

DOI10.1016/J.DISC.2022.113265zbMATH Open1506.05125OpenAlexW4310349380MaRDI QIDQ2111924FDOQ2111924

Authors: Jesmina Pervin, Lavanya Selvaganesh 

Publication date: 17 January 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113265

Recommendations

• On \(Q\)-integral graphs with edge-degrees at most six
• Q-integral graphs with edge-degrees at most five
• On \(Q\)-integral graphs with \(Q\)-spectral radius 6
• \(Q\)-integral graphs with at most two vertices of degree greater than or equal to three
• The bound of \(Q\)-spectral radii of connected graphs with given number of vertices and edges

zbMATH Keywords

signless Laplacian matrixintegral graphedge-degree\(Q\)-integral graph\(Q\)-spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Signless Laplacians of finite graphs
• Title not available (Why is that?)
• Towards a spectral theory of graphs based on the signless Laplacian. I
• Title not available (Why is that?)
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Q-integral graphs with edge-degrees at most five
• Title not available (Why is that?)
• On \(Q\)-integral \((3,s)\)-semiregular bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The nonregular, bipartite, integral graphs with maximum degree 4. I: Basic properties
• Signless Laplacian spectral radius and fractional matchings in graphs
• On \(Q\)-integral graphs with edge-degrees at most six
• \(Q\)-integral graphs with at most two vertices of degree greater than or equal to three
• There are exactly 172 connected integral graphs up to 10 vertices
• Constructing non-isomorphic signless Laplacian cospectral graphs
• Moore-Penrose inverses of the signless Laplacian and edge-Laplacian of graphs

Cited In (3)

• There are exactly 172 connected integral graphs up to 10 vertices
• Integral trees with diameter 6
• Q-integral graphs with edge-degrees at most five

This page was built for publication: Connected \(Q\)-integral graphs with maximum edge-degree less than or equal to 8

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111924)