Results 31 to 40 of about 908,928 (292)
Characterizing 2-Trees Relative to Chordal and Series-Parallel Graphs
Theory and Applications of Graphs, 2021 The 2-connected 2-tree graphs are defined as being constructible from a single 3-cycle by recursively appending new degree-2 vertices so as to form 3-cycles that have unique edges in common with the existing graph.
Terry McKee
doaj +1 more source
On the Complexity of Finding a Sun in a Graph [PDF]
, 2010 The sun is the graph obtained from a cycle of length even and at least six by adding edges to make the even-indexed vertices pairwise adjacent. Suns play an important role in the study of strongly chordal graphs. A graph is chordal if it does not contain
Hoàng, Chính T.
core +2 more sources
Chordal graphs, higher independence and vertex decomposable complexes [PDF]
International journal of algebra and computation, 2021 Given a simple undirected graph $G$ there is a simplicial complex $\mathrm{Ind}(G)$, called the independence complex, whose faces correspond to the independent sets of $G$.
F. M. Abdelmalek +4 more
semanticscholar +1 more source
Exploiting chordal structure in polynomial ideals: a Gr\"obner bases approach [PDF]
, 2016 Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas.
Cifuentes, Diego, Parrilo, Pablo
core +2 more sources
Distributed recoloring of interval and chordal graphs [PDF]
International Conference on Principles of Distributed Systems, 2021 One of the fundamental and most-studied algorithmic problems in distributed computing on networks is graph coloring, both in bounded-degree and in general graphs. Recently, the study of this problem has been extended in two directions. First, the problem
N. Bousquet +3 more
semanticscholar +1 more source
Algorithmic Aspects of Secure Connected Domination in Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan +1 more
doaj +1 more source
Determining what sets of trees can be the clique trees of a chordal graph
Journal of the Brazilian Computer Society, 2012 Chordal graphs have characteristic tree representations, the clique trees. The problems of finding one or enumerating them have already been solved in a satisfactory way.
Pablo De Caria, M. Gutierrez
semanticscholar +1 more source
The vertex leafage of chordal graphs [PDF]
, 2011 Every chordal graph $G$ can be represented as the intersection graph of a collection of subtrees of a host tree, a so-called {\em tree model} of $G$. The leafage $\ell(G)$ of a connected chordal graph $G$ is the minimum number of leaves of the host tree ...
Buneman +19 more
core +1 more source
Powers of chordal graphs [PDF]
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1983 AbstractAn undirected simple graph G is called chordal if every circle of G of length greater than 3 has a chord. For a chordal graph G, we prove the following: (i) If m is an odd positive integer, Gm is chordal. (ii) If m is an even positive integer and if Gm is not chordal, then none of the edges of any chordless cycle of Gm is an edge of Gr, r < ...
R. Balakrishnan, P. Paulraja
openaire +2 more sources
Graph Extremities Defined by Search Algorithms
Algorithms, 2010 Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms called ...
Jean-Paul Bordat +3 more
doaj +1 more source