Results 21 to 30 of about 453 (193)
A linear-time algorithm for semitotal domination in strongly chordal graphs
Discrete Applied Mathematics, 2023 In a graph $G=(V,E)$ with no isolated vertex, a dominating set $D \subseteq V$, is called a semitotal dominating set if for every vertex $u \in D$ there is another vertex $v \in D$, such that distance between $u$ and $v$ is at most two in $G$. Given a graph $G=(V,E)$ without isolated vertices, the Minimum Semitotal Domination problem is to find a ...
Vikash Tripathi +2 more
exaly +4 more sources
Chordal- (k,ℓ)and strongly chordal- (k,ℓ)graph sandwich problems [PDF]
Journal of the Brazilian Computer Society, 2014 In this work, we consider the graph sandwich decision problem for property Π, introduced by Golumbic, Kaplan and Shamir: given two graphs G1=(V,E1) and G2=(V,E2), the question is to know whether there exists a graph G=(V,E) such that E1⊆E⊆E2 and G satisfies property Π. Particurlarly, we are interested in fully classifying the complexity of this problem
Fernanda Couto +2 more
openaire +2 more sources
A parallel algorithm for computing Steiner trees in strongly chordal graphs
Discrete Applied Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dahlhaus, Elias
openaire +3 more sources
Further results on Hendry's Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Recently, a conjecture due to Hendry was disproved which stated that every Hamiltonian chordal graph is cycle extendible. Here we further explore the conjecture, showing that it fails to hold even when a number of extra conditions are imposed.
Manuel Lafond +2 more
doaj +1 more source
Cycle Extendability of Hamiltonian Strongly Chordal Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2021 14 pages, 6 figures.
Guozhen Rong +3 more
openaire +3 more sources
Efficient (j, k)-Dominating Functions
Discussiones Mathematicae Graph Theory, 2023 For positive integers j and k, an efficient (j, k)-dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2, . . ., j} such that the sum of function values in the closed neighbourhood of every vertex equals k. The relationship between the
Klostermeyer William F. +3 more
doaj +1 more source
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
An Algorithm for Generating Strongly Chordal Graphs
CoRR, 2018 Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable in polynomial time for this subclass. However, we are not aware of any algorithm that can generate instances of this class, often necessary for testing purposes.
Md. Zamilur Rahman +2 more
openaire +2 more sources
On Strongly Chordal Graphs That Are Not Leaf Powers [PDF]
, 2017 A common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph G = (V, E) is a leaf power if there exist a tree T on leafset V and a threshold k such that uv is an edge if and only if the distance between u and v in T is at most k.
openaire +2 more sources
Characterizations of strongly chordal graphs
Discrete Mathematics, 1983 AbstractIn this paper we present several characterizations of the class of strongly chordal graphs. These include a forbidden induced subgraph characterization and two characterizations in terms of totally balanced matrices. Another characterization yields a polynomial recognition algorithm.Interest in these graphs arises in several ways.
openaire +1 more source