Maxclique and unit disk characterizations of strongly chordal graphs
نویسندگان
چکیده
Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations. More intriguingly, these characterizations of chordal graphs can be naturally strengthened to new characterizations of strongly chordal graphs
منابع مشابه
Clique Graphs of Chordal and Path Graphs
Clique graphs of chordal and path graphs are characterized. A special class of graphs named expanded trees is discussed. It consists of a subclass of disk-Helly graphs. It is shown that the clique graph of every chordal (hence path) graph is an expanded tree. In addition, every expanded tree is the clique graph of some path (hence chordal) graph. Diierent characterizations of expanded trees are...
متن کاملNC Algorithms for Recognizing Chordal Graphs and k Trees
We present parallel algorithms for recognizing the chordal graphs and k trees. Under the model of computation PRAM with concurrent reading and writing allowed, these algorithms take O(log n) time and require O(n4) processors. Our algorithms have an improved processor-bound than an independent result by Edenbrandt for recognizing chordal graphs in parallel using O(n3m) processors. Furthermore, o...
متن کاملSimplicial and nonsimplicial complete subgraphs
Define a complete subgraph Q to be simplicial in a graph G when Q is contained in exactly one maximal complete subgraph (‘maxclique’) of G; otherwise, Q is nonsimplicial. Several graph classes—including strong p-Helly graphs and strongly chordal graphs—are shown to have pairs of peculiarly related new characterizations: (i) for every k ≥ 2, a certain property holds for the complete subgraphs th...
متن کاملThreshold tolerance graphs
In this paper, we introduce a class of graphs that generalize threshold graphs by introducing threshold tolerances. Several characterizations of these graphs are presented, one of which leads to a polynomial-time recognition algorithm. It is also shown that the complements of these graphs contain interval graphs and threshold graphs, and are contained in the subclass of chordal graphs called st...
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 34 شماره
صفحات -
تاریخ انتشار 2014