Structural conditions for cycle completable graphs

DOI10.1016/0012-365X(95)00107-8MaRDI QIDQ1126192zbMATH OpenFDO

Authors Charles R. Johnson, Terry A. McKee

Publication date 8 December 1996

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

decompositionpositive definite matrixcharacterizationchordal graphseries-parallelcycle completable graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Cycle decompositions of complete graphs
• scientific article; zbMATH DE number 3950581
• scientific article; zbMATH DE number 819129
• New sufficient conditions for cycles in graphs
• Graphs constructible from cycles and complete graphs
• Publication:4206774
• An implicit degree condition for cyclability in graphs
• The structure of graphs with given lengths of cycles
• A sufficient condition for cyclability in directed graphs
• scientific article; zbMATH DE number 4106890

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 48089 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• On the chordality of a graph
• Optimal decomposition by clique separators
• Positive definite completions of partial Hermitian matrices
• Series‐parallel graphs: A logical approach
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Steiner trees, partial 2–trees, and minimum IFI networks
• The Euclidean distance completion problem: cycle completability
• The Euclidian Distance Matrix Completion Problem
• The real positive definite completion problem for a simple cycle
• The real positive definite completion problem: cycle completability
• Topology of series-parallel networks

Cited in

(11)

• Singularity degree of the positive semidefinite matrix completion problem
• scientific article; zbMATH DE number 841628 (Why is no real title available?)
• scientific article; zbMATH DE number 819129 (Why is no real title available?)
• Partial characterizations of 1-perfectly orientable graphs
• Cuts, matrix completions and graph rigidity
• An efficient algorithm for maximum entropy extension of block-circulant covariance matrices
• Characterizing and generalizing cycle completable graphs
• The real positive semidefinite completion problem for series-parallel graphs
• Conditions for a totally positive completion in the case of a symmetrically placed cycle
• Sums of squares and sparse semidefinite programming
• Maximum likelihood threshold and generic completion rank of graphs

This page was built for publication: Structural conditions for cycle completable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126192)