Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
From MaRDI portal
Publication:3797213
DOI10.2307/2001095zbMath0652.05037OpenAlexW4229747599MaRDI QIDQ3797213
Douglas B. West, Thomas M. Kratzke, Bruce Reznick
Publication date: 1988
Full work available at URL: https://doi.org/10.2307/2001095
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Structural characterization of families of graphs (05C75)
Related Items (26)
The generalized distance spectrum of a graph and applications ⋮ Addressing the Petersen graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On 2-colored graphs and partitions of boxes ⋮ On a symmetric representation of Hermitian matrices and its applications to graph theory ⋮ Wiener index and addressing of some finite graphs ⋮ More on the Bipartite Decomposition of Random Graphs ⋮ Finding biclique partitions of co-chordal graphs ⋮ Inertia and biclique decompositions of joins of graphs ⋮ A critical probability for biclique partition of \(G_{n,p}\) ⋮ A tree whose complement is not eigensharp ⋮ Wiener index and addressing of the total graph ⋮ On eigensharp and almost eigensharp graphs ⋮ On the decomposition of random hypergraphs ⋮ Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs ⋮ Addressing graph products and distance-regular graphs ⋮ Decomposition of Random Graphs into Complete Bipartite Graphs ⋮ Unnamed Item ⋮ Secure total domination in graphs: bounds and complexity ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ Eigenvalues and clique partitions of graphs ⋮ On biclique decompositions of complete \(t\)-partite graphs ⋮ Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs ⋮ Unnamed Item ⋮ Bipartite decomposition of random graphs
Cites Work
This page was built for publication: Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
