Connected Q-integral graphs with maximum edge-degree less than or equal to 8
From MaRDI portal
(Redirected from Publication:2111924)
Connected \(Q\)-integral graphs with maximum edge-degree less than or equal to 8
Connected \(Q\)-integral graphs with maximum edge-degree less than or equal to 8
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
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3477222 (Why is no real title available?)
- scientific article; zbMATH DE number 3492726 (Why is no real title available?)
- scientific article; zbMATH DE number 3556146 (Why is no real title available?)
- scientific article; zbMATH DE number 1029224 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Constructing non-isomorphic signless Laplacian cospectral graphs
- Moore-Penrose inverses of the signless Laplacian and edge-Laplacian of graphs
- On \(Q\)-integral \((3,s)\)-semiregular bipartite graphs
- On \(Q\)-integral graphs with edge-degrees at most six
- Q-integral graphs with edge-degrees at most five
- Signless Laplacian spectral radius and fractional matchings in graphs
- Signless Laplacians of finite graphs
- The nonregular, bipartite, integral graphs with maximum degree 4. I: Basic properties
- There are exactly 172 connected integral graphs up to 10 vertices
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- \(Q\)-integral graphs with at most two vertices of degree greater than or equal to three
Cited in
(5)
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)