On characterizing proper max-point-tolerance graphs

DOI10.1080/09728600.2023.2245430MaRDI QIDQ6152618zbMATH OpenOpenAlexFDO

Authors Sanchita Paul

Publication date 12 March 2024

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2002.01349

zbMATH Keywords

interval graphmax-point-tolerance graphmax-tolerance graphproper interval graphtolerance graph

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)

Abstract: Max-point-tolerance graphs (MPTG) was introduced by Catanzaro et al. in 2017 as a generalization of interval graphs. This graph class has many practical applications in study of human genome as well as in signal processing for networks. The same class of graphs were also studied in the name of p-BOX(1) graphs by Soto and Caro in 2015. In our article, we consider a natural subclass of max-point-tolerance graphs namely, proper max-point-tolerance graphs (proper MPTG) where intervals associated to the vertices are not contained in each other properly. We present the first characterization theorem of this graph class by defining certain linear ordering on the vertex set. In course of this study we prove proper max-point-tolerance graphs are asteroidal triple free and perfect. We also find proper max-point-tolerance graphs are equivalent to unit max-point-tolerance graphs. Further we note that MPTG (proper MPTG) and max-tolerance graphs (proper max-tolerance graphs) are incomparable. In conclusion we demonstrate relations between proper MPTG with other variants of MPTG and max-tolerance graphs.

Recommendations

• On central max-point-tolerance graphs
• Max point-tolerance graphs
• Proper and unit tolerance graphs
• scientific article; zbMATH DE number 1735726
• Tolerance graphs

Cites work

• p-box: a new graph model
• A short proof that `proper = unit'
• Adjacency matrices of probe interval graphs
• Algorithmic graph theory and perfect graphs
• Asteroidal Triple-Free Graphs
• Circular-arc bigraphs and its subclasses
• scientific article; zbMATH DE number 3853140 (Why is no real title available?)
• scientific article; zbMATH DE number 3877239 (Why is no real title available?)
• Incidence matrices and interval graphs
• Interval digraphs: An analogue of interval graphs
• Max point-tolerance graphs
• Max-tolerance graphs as intersection graphs
• On central max-point-tolerance graphs
• Representation of a finite graph by a set of intervals on the real line

This page was built for publication: On characterizing proper max-point-tolerance graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6152618)