The Maximum Order of Reduced Square (0, 1)- Matrices with a Given Rank
نویسندگان
چکیده
منابع مشابه
Ela the Maximum Order of Reduced Square (0, 1)-matrices with a given Rank∗
The maximum order of a square (0, 1)-matrix A with a fixed rank r is considered, provided A has no repeated rows or columns. When A is the adjacency matrix of a graph, Kotlov and Lovász [A. Kotlov and L. Lovász. The rank and size of graphs. J. Graph Theory, 23:185–189, 1996.] proved that the maximum order equals Θ(2r/2). In this note, it is showed that this result remains correct if A is symmet...
متن کاملThe maximum order of reduced square (0,1)-matrices with a given rank
The maximum order of a square (0, 1)-matrix A with a fixed rank r is considered, provided A has no repeated rows or columns. When A is the adjacency matrix of a graph, Kotlov and Lovász [A. Kotlov and L. Lovász. The rank and size of graphs. J. Graph Theory, 23:185–189, 1996.] proved that the maximum order equals Θ(2r/2). In this note, it is showed that this result remains correct if A is symmet...
متن کاملMaximum Order of Triangle-Free Graphs with a Given Rank
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced triangle-free graphs with a given rank and characterize all such graphs achieving the maximum order.
متن کاملPossible numbers of ones in 0–1 matrices with a given rank
A 0–1 matrix is a matrix whose entries are either 0 or 1. Such matrices arise frequently in combinatorics and graph theory. It is known [1, p. 243] that the largest number of ones in an n n nonsingular 0–1 matrix is n nþ 1: Interpreting nonsingularity as full rank, we may ask further the question: What are the possible numbers of ones in a 0–1 matrix with given rank? We will answer this questio...
متن کاملOn the maximum rank of Toeplitz block matrices of blocks of a given pattern
We show that the maximum rank of block lower triangular Toeplitz block matrices equals their term rank if the blocks fulfill a structural condition, i.e., only the locations but not the values of their nonzeros are fixed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2011
ISSN: 1556-5068
DOI: 10.2139/ssrn.1948490