On order and rank of graphs

DOI10.1007/s00493-015-2922-4zbMath1399.05147OpenAlexW1551893067MaRDI QIDQ1701307

Ebrahim Ghorbani, B. Tayfeh-Rezaie, Ali Mohammadian

Publication date: 22 February 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-015-2922-4

zbMATH Keywords

rankvertex

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (3)

Maximum order of graphs with a given corank ⋮ A discrete variation of the Littlewood-Offord problem ⋮ Maximal graphs with respect to rank

Cites Work

• Unnamed Item
• The maximum order of adjacency matrices of graphs with a given rank
• The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
• Communication complexity and combinatorial lattice theory
• The rank of a cograph
• Maximum order of trees and bipartite graphs with a given rank
• Sphere packings. (Edited by John Talbot)
• Chromatic number and the 2-rank of a graph
• On rank vs. communication complexity
• A counterexample to the rank-coloring conjecture
• A Bound for the Chromatic Number of a Graph
• Rank and chromatic number of a graph
• The rank and size of graphs
• Maximum Order of Triangle‐Free Graphs with a Given Rank
• The Closest Packing of Spherical Caps in n Dimensions

This page was built for publication: On order and rank of graphs