Eigenvalues and partitionings of the edges of a graph

DOI10.1016/0024-3795(72)90023-7zbMATH Open0247.05125OpenAlexW2156563793MaRDI QIDQ2555865FDOQ2555865

Authors: Alan J. Hoffman 

Publication date: 1972

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(72)90023-7

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• ON EIGENVALUES AND COLORINGS OF GRAPHS, II
• Title not available (Why is that?)

Cited In (21)

• Spectral radius and clique partitions of graphs
• Generalized quasirandom properties of expanding graph sequences
• Concerning the achromatic number of graphs
• Spectra, Euclidean representations and clusterings of hypergraphs
• 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
• Spectra of total graphs
• The minimum rank of symmetric matrices described by a graph: a survey
• On a problem of Zaks
• Problems and invariants connected with bicliques and multicliques of graphs
• Eigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
• 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)