More about singular line graphs of trees
From MaRDI portal
Recommendations
Cited in
(15)- Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities
- On the displacement of eigenvalues when removing a twin vertex
- Block-indifference graphs: characterization, structural and spectral properties
- An operation based on complete graphs with an application to the line graphs of trees.
- The singularity of the complement of trees with diameter n-1, n-2 or n-3
- Singular σ-dense trees
- scientific article; zbMATH DE number 1472133 (Why is no real title available?)
- scientific article; zbMATH DE number 1491632 (Why is no real title available?)
- Graphs with least eigenvalue -2: ten years on
- On the nullity number of graphs
- Distinguished minimal topological lassos
- On the nullity of a graph with cut-points
- On the eigenvalues of distance powers of circuits
This page was built for publication: More about singular line graphs of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5424692)