Block-indifference graphs: characterization, structural and spectral properties
From MaRDI portal
Publication:2328093
DOI10.1016/J.DAM.2018.11.034zbMATH Open1421.05061OpenAlexW2906037112WikidataQ128776350 ScholiaQ128776350MaRDI QIDQ2328093FDOQ2328093
Authors: Claudia Justel, Lilian Markenzon, Carla Silva Oliveira, Nair Abreu, Christina F. E. M. Waga
Publication date: 9 October 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.11.034
Recommendations
- Integer Laplacian eigenvalues of chordal graphs
- On the spectral radius of block graphs with prescribed independence number \(\alpha\)
- On the spectral radius of block graphs having all their blocks of the same size
- Chain graph sequences and Laplacian spectra of chain graphs
- On the inverse eigenvalue problem for block graphs
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- Algorithmic graph theory and perfect graphs
- On the compatibility between a graph and a simple order
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the tree representation of chordal graphs
- Title not available (Why is that?)
- On the nullity of line graphs of trees
- The number of caterpillars
- On algebraic connectivity of graphs with at most two points of articulation in each block
- Bandwidth and density for block graphs
- Title not available (Why is that?)
- Degree maximal graphs are Laplacian integral
- Clique tree generalization and new subclasses of chordal graphs
- One-phase algorithm for the determination of minimal vertex separators of chordal graphs
- Title not available (Why is that?)
- Counting planar graphs and related families of graphs
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- Generating and counting unlabeled \(k\)-path graphs
- More about singular line graphs of trees
- Line graph eigenvalues and line energy of caterpillars
- On the index of necklaces
- On the adjacency, Laplacian, and signless Laplacian spectrum of coalescence of complete graphs
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
- Counting and enumerating unlabeled split-indifference graphs
Cited In (4)
This page was built for publication: Block-indifference graphs: characterization, structural and spectral properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2328093)