The maximum order of adjacency matrices of graphs with a given rank

DOI10.1007/s10623-011-9548-3zbMath1254.05102OpenAlexW2081426440MaRDI QIDQ690659

M. J. P. Peeters, Willem H. Haemers

Publication date: 28 November 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-011-9548-3

zbMATH Keywords

adjacency matrix

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (8)

Maximum order of graphs with a given corank ⋮ A discrete variation of the Littlewood-Offord problem ⋮ On order and rank of graphs ⋮ Maximal graphs with respect to rank ⋮ Maximum order of trees and bipartite graphs with a given rank ⋮ Conformally covariant operators and conformal invariants on weighted graphs ⋮ Relations between (κ, τ)-regular sets and star complements ⋮ Maximum Order of Triangle‐Free Graphs with a Given Rank

Cites Work

• Chromatic number and the 2-rank of a graph
• The rank and size of graphs

This page was built for publication: The maximum order of adjacency matrices of graphs with a given rank