Adjacency matrices of probe interval graphs

DOI10.1016/j.dam.2010.08.018zbMath1215.05104OpenAlexW2001328726MaRDI QIDQ608289

Shamik Ghosh, Maitry Podder, Malay Kr. Sen

Publication date: 25 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.018

zbMATH Keywords

interval graphadjacency matrix of a graphFerrers dimensioninterval bigraphFerrers bigraphprobe interval graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

On characterizing proper max-point-tolerance graphs ⋮ A characterization of 2-tree proper interval 3-graphs ⋮ Abelian Semigroups of Matrices on ℂⁿ and Hypercyclicity ⋮ On central max-point-tolerance graphs

Cites Work

• The complexity of comparability graph recognition and coloring
• On probe interval graphs
• Recognizing interval digraphs and interval bigraphs in polynomial time
• Short proofs for interval digraphs
• Chordal probe graphs
• Representing digraphs using intervals or circular arcs
• On probe classes of graphs
• Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs
• Interval digraphs: An analogue of interval graphs
• Circular‐arc digraphs: A characterization
• Topics in Intersection Graph Theory
• Interval bigraphs and circular arc graphs
• Computing and Combinatorics
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item