Results 21 to 30 of about 10,951 (224)
SIAM Journal on Discrete Mathematics, 1994 The authors give a unified framework for characterizations of graphs which are dual (in the sense of hypergraphs) to chordal graphs, in terms of neighborhood and clique hypergraphs. By using the hypergraph approach in a systematical way, new results are obtained, a part of previous results are generalized, and some of the proofs are simplified.
Brandstadt, A. +3 more
openaire +3 more sources
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
Discrete Applied Mathematics, 2003 A graph \(G=(V, E)\) is a chordal probe graph if there exists a partition \(V=P\cup N\) with a stable set \(N\) and a completion \(E'\subseteq\{uv : u\not= v\in N\}\) such that the graph \((V, E\cup E')\) is a chordal graph. Chordal probe graphs generalize probe interval graphs introduced by P. Zhang; see also [\textit{F. R. McMorris, C.
Golumbic, Martin Charles +1 more
openaire +2 more sources
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
Bipartite powers of k-chordal graphs [PDF]
, 2012 Let k be an integer and k \geq 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive
Chandran, L. Sunil, Mathew, Rogers
core +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
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceCover-Incomparability graphs (C-I graphs) are an interesting class of graphs from posets. A C-I graph is a graph from a poset $P=(V,\le)$ with vertex set $V$, and the edge-set is the union of edge sets of the cover graph and the incomparability graph of ...
Arun Anil, Manoj Changat
doaj +1 more source
Journal of Combinatorial Theory, Series A, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Herzog, Jürgen +2 more
openaire +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
The Dilworth Number of Auto-Chordal-Bipartite Graphs [PDF]
, 2013 The mirror (or bipartite complement) mir(B) of a bipartite graph B=(X,Y,E) has the same color classes X and Y as B, and two vertices x in X and y in Y are adjacent in mir(B) if and only if xy is not in E. A bipartite graph is chordal bipartite if none of
Berry, Anne +2 more
core +1 more source