• 1
  • 1
  • 2
  • 5
  • 6
  • 6
  • 3
  • 4
IPM
30
YEARS OLD

“School of Mathematics”

Back to Papers Home
Back to Papers of School of Mathematics

Paper   IPM / M / 8425
School of Mathematics
  Title:   Some relations between rank of a graph and its complement
  Author(s): 
1.  S. Akbari
2.  A. Alipour
3.  E. Ghorbani (Joint with J. Ebrahimi Boroojeni and M. Mirjalalieh Shirazi)
  Status:   Published
  Journal: Linear Algebra Appl.
  Vol.:  422
  Year:  2007
  Pages:   341-347
  Supported by:  IPM
  Abstract:
Let G be a graph of order n and rank(G) denotes the rank of its adjacency matrix. Clearly, n \leqslant rank (G) + rank G \leqslant 2n. In this paper we characterize all graphs G such that rank(G) + rank(G) = n, n + 1 or n + 2. Also for every integer n \geqslant 5 and any k, 0\leqslant k \leqslant n, we construct a graph G of order n, such that rank(G) + rank (G) = n + k.

Download TeX format
back to top
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
scroll left or right