On (k+1)-line graphs of k-trees and their nullities
From MaRDI portal
Publication:2229485
DOI10.1016/J.LAA.2020.04.008zbMATH Open1459.05183OpenAlexW3017111495MaRDI QIDQ2229485FDOQ2229485
Authors: Allana S. S. Oliveira, Cybele T. M. Vinagre, Lilian Markenzon, Maria Aguieiras A. de Freitas 
Publication date: 17 February 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.04.008
Recommendations
Cites Work
- Title not available (Why is that?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Trees with maximum nullity
- On the trees with maximum nullity
- Title not available (Why is that?)
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
- TWO THEOREMS IN GRAPH THEORY
- Perfect k‐line graphs and k‐total graphs
- The number of labeled k-dimensional trees
- On the nullity of graphs with pendent vertices
- Nullity of graphs
- Title not available (Why is that?)
- Subclasses of \(k\)-trees: characterization and recognition
- More about singular line graphs of trees
- Integral trees with given nullity
- The signless Laplacian spectral radius of bounded degree graphs on surfaces
- Corrigendum to: ``On the signless Laplacian spectra of \(k\)-trees
- Graph families with constant distance determinant
- Linear time algorithm to check the singularity of block graphs
Cited In (4)
This page was built for publication: On \((k+1)\)-line graphs of \(k\)-trees and their nullities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229485)
