Results 231 to 240 of about 946,691 (269)
Some of the next articles are maybe not open access.

Regularity of symbolic powers of edge ideals of chordal graphs

Kyoto Journal of Mathematics, 2022
S. A. Seyed Fakhari
semanticscholar   +1 more source

Dominating Sets in Chordal Graphs

SIAM Journal on Computing, 1982
A set of vertices D is a dominating set for a graph if every vertex is either in D or adjacent to a vertex which is in D. We show that the problem of finding a minimum dominating set in a chordal graph is NP-complete, even when restricted to undirected path graphs, but exhibit a linear time greedy algorithm for the problem further restricted to ...
Booth, Kellogg S., Johnson, J. Howard
openaire   +2 more sources

Chordal Graphs and Their Clique Graphs

INTERNATIONAL JOURNAL OF COMPUTING ALGORITHM, 2014
Arockia Aruldoss J, K. P
semanticscholar   +2 more sources

Reconstruction and verification of chordal graphs with a distance oracle

Theoretical Computer Science, 2021
Guozhen Rong   +3 more
semanticscholar   +1 more source

Graph searching on chordal graphs

1996
Two variations of the graph searching problem, edge searching and node searching, are studied on several classes of chordal graphs, which include split graphs, interval graphs and k-starlike graphs.
Sheng-Lung Peng   +4 more
openaire   +1 more source

Matrix Completions and Chordal Graphs

Acta Mathematica Sinica, English Series, 2003
This paper is an introduction to few problems and results in matrix completion problems. The topics which are considered here include questions on norm completions, rank completions, positive definite completions, numerical range completion properties and rank decomposability.
openaire   +2 more sources

Coloring Powers of Chordal Graphs

SIAM Journal on Discrete Mathematics, 2004
Summary: We prove that the \(k\)th power \(G^{k}\) of a chordal graph \(G\) with maximum degree \(\Delta\) is \(O(\sqrt{k}\Delta^{(k+1)/2})\)-degenerate for even values of \(k\) and \(O(\Delta^{(k+1)/2})\)-degenerate for odd values. In particular, this bounds the chromatic number \(\chi(G^k)\) of the \(k\)th power of \(G\).
openaire   +1 more source

2 — Chordal Graphs

1988
Let P be an undirected graph with vertices V and edges E. Fix an enumeration, {v1,v2,...,vn}, of V and let M(P) = {A ∈ Mn (ℂ)| = 0 if (vi,vj) ∉ E where ei is the standard orthonormal basis of ℂn. Mn (ℂ)+ is the set of positive semi-definite n × n matrices with complex entries.
openaire   +1 more source

Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel

International Workshop on Graph-Theoretic Concepts in Computer Science, 2021
C. Crespelle   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy