Results 11 to 20 of about 51,213 (189)
Koszul graded Möbius algebras and strongly chordal graphs [PDF]
Selecta MathematicaThe graded Möbius algebra of a matroid is a commutative graded algebra which encodes the combinatorics of the lattice of flats of the matroid. As a special subalgebra of the augmented Chow ring of the matroid, it plays an important role in the recent ...
Adam LaClair +3 more
semanticscholar +4 more sources
Broadcast domination and multipacking in strongly chordal graphs
Discrete Applied Mathematics, 2019 A linear programming algorithm to compute the broadcast domination number and the multipacking number of a strongly chordal graph is described. It runs in time cubic in the number of vertices of the input graph.
R. Brewster +2 more
semanticscholar +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.
M. Farber
semanticscholar +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.
Ryuhei Uehara +2 more
semanticscholar +2 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. In this paper, we have investigated the characterization of Super Strongly Perfect graphs using odd cycles.
R. Jothi, A. Amutha
semanticscholar +3 more sources
A characterization of strongly chordal graphs
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Dahlhaus, P. Manuel, Mirka Miller
semanticscholar +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
Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Dahlhaus, Marek Karpinski
semanticscholar +3 more sources
Total Roman domination on the digraphs
Open Mathematics, 2023 Let D=(V,A)D=\left(V,A) be a simple digraph with vertex set VV, arc set AA, and no isolated vertex. A total Roman dominating function (TRDF) of DD is a function h:V→{0,1,2}h:V\to \left\{0,1,2\right\}, which satisfies that each vertex x∈Vx\in V with h(x ...
Zhang Xinhong, Song Xin, Li Ruijuan
doaj +1 more source
Rainbow domination and related problems on strongly chordal graphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. Chang, Bo-Jr Li, Jiaojiao Wu
semanticscholar +3 more sources