Results 11 to 20 of about 55,028 (193)
Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs
Discrete Applied Mathematics, 2000 In this paper those graphs are studied for which a so-called strong ordering of the vertex set exists. This class of graphs, called strongly orderable graphs, generalizes the strongly chordal graphs and the chordal bipartite graphs in a quite natural way.
Feodor F Dragan
exaly +3 more sources
Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs
Mapana - Journal of Sciences, 2012 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.
Amutha, A, Jeya Jothi, R Mary
core +3 more sources
A new characterization of strongly chordal graphs
Discrete Mathematics, 1999 The ‘strength’ of an edge or cycle is the number of maximal complete subgraphs it is in. Strongly chordal graphs are characterized by every cycle of edges of strengths at least k with no chord of strength at least k always itself having strength at least
McKee, Terry A.
core +3 more sources
Domination, independent domination, and duality in strongly chordal graphs
Discrete Applied Mathematics, 1984 We present polynomial algorithms to locate minimum weight dominating sets and independent dominating sets in strongly chordal graphs. We utilize an intimate relationship between strongly chordal graphs and totally balanced matrices to show that the ...
Farber, Martin, Martin Farber
core +3 more sources
All-pairs-shortest-length on strongly chordal graphs
Discrete Applied Mathematics, 1996 The all-pairs-shortest-length (APSL) problem has been quite rigorously studied on various graphs. On general graphs, solutions are known for both the unweighted and weighted cases.
Rangan, C.Pandu, Balachandhran, V.
core +3 more sources
Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
Discrete Mathematics, 1990 We study a new version of the domination problem in which the dominating set is required to be a clique. The minimum dominating clique problem is NP-complete for split graphs and, hence, for chordal graphs. We show that for two other important subclasses
Kratsch, Dieter, Dieter Kratsch
core +3 more sources
Cycle Extendability of Hamiltonian Strongly Chordal Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2020 In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjecture is yet refuted by Lafond and Seamone in 2015.
Guozhen Rong +3 more
semanticscholar +5 more sources
Semi-dynamic Algorithms for Strongly Chordal Graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2020 Within the broad ambit of algorithm design, the study of dynamic graph algorithms continues to be a thriving area of research. Commensurate with this interest is an extensive literature on the topic. Not surprisingly, dynamic algorithms for all varieties
Md. Zamilur Rahman, A. Mukhopadhyay
semanticscholar +4 more sources
Strongly chordal and chordal bipartite graphs are sandwich monotone
Journal of Combinatorial Optimization, 2011 A graph class is sandwich monotone if, for every pair of its graphs G (1)=(V,E (1)) and G (2)=(V,E (2)) with E (1)aS,E (2), there is an ordering e (1),aEuro broken vertical bar,e (k) of the edges in E (2)a-E (1) such that G=(V,E (1)a(a){e (1),aEuro ...
Heggernes, P. +3 more
core +5 more sources
Mutual transferability for (F,B,R)-domination on strongly chordal graphs and cactus graphs
Discrete Applied Mathematics, 2019 This paper studies a variation of domination in graphs called ( F , B , R ) -domination. Let G = ( V , E ) be a graph and V be the disjoint union of F , B , and R , where F consists of free vertices, B consists of bound vertices, and R consists of ...
Chiuyuan Chen
exaly +2 more sources