Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs

DOI10.2307/2001095MaRDI QIDQ3797213zbMATH OpenOpenAlexFDO

Authors Thomas M. Kratzke, Bruce Reznick, Douglas B. West

Publication date 1988

Full work available at URL https://doi.org/10.2307/2001095

zbMATH Keywords

complete bipartite subgraphsedge partitionEigensharp graphseigenvaluesweak products

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• On eigensharp and almost eigensharp graphs
• On eigensharpness and almost eigensharpness of lexicographic products of some graphs
• A tree whose complement is not eigensharp
• Decomposition of product graphs into complete bipartite subgraphs
• On the eigensharp of corona product

Cites work

• A new proof of a theorem of Graham and Pollak
• Decomposition of product graphs into complete bipartite subgraphs
• Eigenvalues and partitionings of the edges of a graph
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 3395950 (Why is no real title available?)
• scientific article; zbMATH DE number 3414355 (Why is no real title available?)
• On the decomposition ofkn into complete bipartite graphs
• The biparticity of a graph

Cited in

(33)

• Decomposition of product graphs into complete bipartite subgraphs
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• Inertia and biclique decompositions of joins of graphs
• Secure total domination in graphs: bounds and complexity
• On biclique decompositions of complete \(t\)-partite graphs
• Addressing the Petersen graph
• A tree whose complement is not eigensharp
• Wiener index and addressing of the total graph
• Addressing graph products and distance-regular graphs
• Eigenvalues and clique partitions of graphs
• Bipartite decomposition of random graphs
• On 2-colored graphs and partitions of boxes
• More on the bipartite decomposition of random graphs
• Computation of the biclique partition number for graphs with specific blocks
• Problems and invariants connected with bicliques and multicliques of graphs
• The generalized distance spectrum of a graph and applications
• On the eigensharp of corona product
• On eigensharpness and almost eigensharpness of lexicographic products of some graphs
• Addressing Johnson graphs, complete multipartite graphs, odd cycles, and random graphs
• A unified method for eigendecomposition of graph products
• scientific article; zbMATH DE number 2230282 (Why is no real title available?)
• Decomposition of random graphs into complete bipartite graphs
• Eigensharp property of some certain graphs and their complements
• Wiener index and addressing of some finite graphs
• Finding biclique partitions of co-chordal graphs
• A critical probability for biclique partition of \(G_{n,p}\)
• Complete bipartite decompositions of crowns, with applications to complete directed graphs
• Spectra of total graphs
• On the decomposition of random hypergraphs
• Some eigensharp and almost eigensharp graphs
• On a symmetric representation of Hermitian matrices and its applications to graph theory
• On eigensharp and almost eigensharp graphs
• The minimum rank of symmetric matrices described by a graph: a survey

This page was built for publication: Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs

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