Strongly chordal graph - Open Access .click

Results 91 to 100 of about 3,915 (163)

Domination, independent domination, and duality in strongly chordal graphs

Discrete Applied Mathematics, 1984
Polynomial-time algorithms for finding minimum weight dominating sets and independent dominating sets in strongly chordal graphs are presented in this paper. The algorithms are based on linear programming formulations of the problems and consist of two stages: in the first - a greedy algorithm is used to solve the corresponding dual program, and in the
openaire +1 more source

ChoCo: a Chord Corpus and a Data Transformation Workflow for Musical Harmony Knowledge Graphs. [PDF]

Sci Data, 2023
de Berardinis J +3 more
europepmc +1 more source

Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs

Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs
This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs, chordal graphs, comparability graphs, split graphs, and k-trees for unbounded k.
openaire

Erratum to “Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs”

Discrete Mathematics, 2003
openaire +1 more source

Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]

Heliyon
Afridi MUK, Rehman IU, Ishaq M.
europepmc +1 more source

Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]

J Stat Theory Pract
Röttger F, Kahle T, Schwabe R.
europepmc +1 more source

Dependency Structures in Cryptocurrency Market from High to Low Frequency. [PDF]