Browse > Article

For the quadrangular graphs  

Jeong, Nae-Gyeong (서남대학교 컴퓨터응용수학과)
Im, Hyung-Kyu (신경대학교 인터넷정보통신학과)
Park, Se-Won (신경대학교 교양과)
Publication Information
The Journal of the Korea institute of electronic communication sciences / v.5, no.3, 2010 , pp. 239-244 More about this Journal
Abstract
In this paper, we study the adjacency matrix of a minimal connected quadrangular graph G, and then we obtain an upper bound on |E(G)| for such a graph G, and we obtain the graph for which the upper bound is attained. In addition, we obtain an upper bound on |E(G)| for a critical matching covered quadrangular graph G.
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 P. M. Gibson and G.-H. Zhang, Combina torially orthogonal matrices and related graphs, Lin. Alg. Applics, 282 (1998), 83-95.   DOI
2 K. B. Reid and C. Thomassen, Egde sets contained in circuits, Israel J. Math. 24 (1976), 305-319.   DOI