Block-indifference graphs: characterization, structural and spectral properties

DOI10.1016/j.dam.2018.11.034zbMath1421.05061OpenAlexW2906037112WikidataQ128776350 ScholiaQ128776350MaRDI QIDQ2328093

Lilian Markenzon, Carla Silva Oliveira, Claudia Marcela Justel, Christina Fraga Esteves Maciel Waga, Nair Maria Maia De Abreu

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

zbMATH Keywords

countingLaplacian eigenvaluesblock-indifference graphs

Mathematics Subject Classification ID

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

Related Items (3)

Strictly chordal graphs: structural properties and integer Laplacian eigenvalues ⋮ Integer Laplacian eigenvalues of chordal graphs ⋮ Positive semidefiniteness of \(A_\alpha (G)\) on some families of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating and counting unlabeled \(k\)-path graphs
• 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
• Degree maximal graphs are Laplacian integral
• Clique tree generalization and new subclasses of chordal graphs
• Bandwidth and density for block graphs
• Algorithmic graph theory and perfect graphs
• On the compatibility between a graph and a simple order
• The number of caterpillars
• On algebraic connectivity of graphs with at most two points of articulation in each block
• One-phase algorithm for the determination of minimal vertex separators of chordal graphs
• On the tree representation of chordal graphs
• Graph Classes: A Survey
• A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
• Counting and enumerating unlabeled split–indifference graphs
• More about singular line graphs of trees
• On the nullity of line graphs of trees

This page was built for publication: Block-indifference graphs: characterization, structural and spectral properties