Results 31 to 40 of about 12,115 (251)
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
自余弱弦图(On self-complementary weakly chordal graphs)
Zhejiang Daxue xuebao. Lixue ban, 2010 The class of self-complementary (sc) weakly chordal graphs is studied, which is a generalization of self-complementary chordal graphs, lower and upper bounds for the number of two-pairs in sc weakly chordal graphs have been obtained.
MERAJUDDIN() +3 more
doaj +1 more source
On some simplicial elimination schemes for chordal graphs [PDF]
, 2008 We present here some results on particular elimination schemes for chordal graphs, namely we show that for any chordal graph we can construct in linear time a simplicial elimination scheme starting with a pending maximal clique attached via a minimal ...
Habib, Michel, Limouzy, Vincent
core +4 more sources
Computing a Clique Tree with the Algorithm Maximal Label Search
Algorithms, 2017 The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS), Lexicographic Breadth-First Search (LexBFS), Lexicographic Depth-First Search (LexDFS) and Maximal Neighborhood Search (
Anne Berry, Geneviève Simonet
doaj +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
Representations of Edge Intersection Graphs of Paths in a Tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let $\mathcal{P}$ be a collection of nontrivial simple paths in a tree $T$. The edge intersection graph of $\mathcal{P}$, denoted by EPT($\mathcal{P}$), has vertex set that corresponds to the members of $\mathcal{P}$, and two vertices are joined by an ...
Martin Charles Golumbic +2 more
doaj +1 more source
The Lefthanded Local Lemma characterizes chordal dependency graphs [PDF]
, 2012 Shearer gave a general theorem characterizing the family $\LLL$ of dependency graphs labeled with probabilities $p_v$ which have the property that for any family of events with a dependency graph from $\LLL$ (whose vertex-labels are upper bounds on the ...
Pegden, Wesley
core +2 more sources
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uehara, Ryuhei +2 more
openaire +1 more source
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 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 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
doaj +1 more source
On the multipacking number of grid graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted $\gamma_b(G)$.
Laurent Beaudou, Richard C. Brewster
doaj +1 more source