Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Clique Trees of Infinite Locally Finite Chordal Graphs
View through CrossRef
We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees. Even more, the edges of a clique tree are in bijection with the edges of the corresponding collection of finite trees. This allows us to enumerate the clique trees of a chordal graph and extend various classic characterisations of clique trees to the infinite setting.
The Electronic Journal of Combinatorics
Title: Clique Trees of Infinite Locally Finite Chordal Graphs
Description:
We investigate clique trees of infinite locally finite chordal graphs.
Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees.
Even more, the edges of a clique tree are in bijection with the edges of the corresponding collection of finite trees.
This allows us to enumerate the clique trees of a chordal graph and extend various classic characterisations of clique trees to the infinite setting.
.
Related Results
Sobre grafos clique críticos
Sobre grafos clique críticos
Se llama completo de un grafo a un conjunto de vértices adyacentes entre si; si un completo es maximal con respecto a la inclusión, se dice que es un clique del grafo. Los cliques ...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs
Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper, w...
Weakly Modular Graphs and Nonpositive Curvature
Weakly Modular Graphs and Nonpositive Curvature
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying t...
Rank-sparsity decomposition for planted quasi clique recovery
Rank-sparsity decomposition for planted quasi clique recovery
Abstract
In this paper, we apply the Rank-Sparsity Matrix Decomposition to the planted Maximum Quasi-Clique Problem (MQCP). This problem has ...
Hardness and algorithmic results for Roman \{3\}-domination
Hardness and algorithmic results for Roman \{3\}-domination
A Roman $\{3\}$-dominating function on a graph $G = (V, E)$ is a function $f: V \rightarrow \{0, 1, 2, 3\}$ such that for each vertex $u \in V$, if $f(u) = 0$ then $\sum\limits_{v ...
Edge open packing on subclasses of chordal graphs
Edge open packing on subclasses of chordal graphs
Packing problems on graphs are fundamental in combinatorial optimization and arise naturally in applications such as resource allocation, scheduling, and communication networks. A ...
Complexity of Hamiltonian Cycle Reconfiguration
Complexity of Hamiltonian Cycle Reconfiguration
The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C ...