| Home  | About ScienceAsia  | Publication charge  | Advertise with us  | Subscription for printed version  | Contact us  
Editorial Board
Journal Policy
Instructions for Authors
Online submission
Author Login
Reviewer Login
Volume 50 Number 1
Volume 49 Number 6
Volume 49 Number 5
Volume 49S Number 1
Volume 49 Number 4
Volume 49 Number 3
Earlier issues
Volume  Number 

previous article next article

Research articles

ScienceAsia 47 (2021): 779-784 |doi: 10.2306/scienceasia1513-1874.2021.099


A lower bound of the rank of a signed graph in terms of order and maximum degree


Yong Lua,*, Wei-Ru Xub

 
ABSTRACT:     that r(K a,b) = 2 (a, b ? 2) if and only if all the cycles of order 4 in K a,b are balanced. Using this result, we also prove that r(

Download PDF

58 Downloads 679 Views


a School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, Jiangsu 221116 China
b School of Mathematical Sciences, Sichuan Normal University, Chengdu, Sichuan 610066 China

* Corresponding author, E-mail: luyong@jsnu.edu.cn

Received 25 Sep 2020, Accepted 21 Jul 2021