Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs

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

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

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?)
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
On the decomposition ofkn into complete bipartite graphs
The biparticity of a graph

Cited in

(32)

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

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)