Eigenvalues and partitionings of the edges of a graph
From MaRDI portal
(Redirected from Publication:2555865)
Cites work
- scientific article; zbMATH DE number 3902697 (Why is no real title available?)
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 3349875 (Why is no real title available?)
- scientific article; zbMATH DE number 3383912 (Why is no real title available?)
- ON EIGENVALUES AND COLORINGS OF GRAPHS, II
Cited in
(21)- Spectral radius and clique partitions of graphs
- Concerning the achromatic number of graphs
- Spectra, Euclidean representations and clusterings of hypergraphs
- Generalized quasirandom properties of expanding graph sequences
- A criterion for the similarity of a closed operator to a self-adjoint operator
- On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs
- Eigenvalues and clique partitions of graphs
- Homogeneous multivariate polynomials with the half-plane property
- Graph theory (algorithmic, algebraic, and metric problems)
- Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
- Regularity-based spectral clustering and mapping the Fiedler-carpet
- Graph with given achromatic number
- The minimum rank of symmetric matrices described by a graph: a survey
- Spectra of total graphs
- On a problem of Zaks
- Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
- Problems and invariants connected with bicliques and multicliques of graphs
- On the achromatic number of signed graphs
- Algebraic connectivity of network-of-networks having a graph product structure
- A lower estimate for the achromatic number of irreducible graphs
- Inertia and biclique decompositions of joins of graphs
This page was built for publication: Eigenvalues and partitionings of the edges of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2555865)
