The competition numbers of Johnson graphs with diameter four
In 2010, Kim, Park and Sano studied the competition numbers of Johnson graphs. They gave the competition numbers of J(n,2) and J(n,3).In this note, we consider the competition number of J(n,4).
Saved in:
Main Author: | Kim, Kijung; Department of Mathematics Pusan National University Busan 46241, Republic of Korea (Author) |
---|---|
Other Authors: | This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) (Contributor) |
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2017-10-16.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the distance domination number of bipartite graphs
by: Mojdeh, Doost Ali; Department of Mathematics, University of Mazandaran, Babolsar, Iran, et al.
Published: (2020) -
On the signed $2$-independence number of graphs
by: Moghaddam, S.M. Hosseini; Qom Azad University, Qom, Iran, et al.
Published: (2017) -
Domination number of the non-commuting graph of finite groups
by: Vatandoost, Ebrahim; Department of Mathematics, Faculty of Science, Imam Khomeini International University, Qazvin, Iran, et al.
Published: (2018) -
On the Steiner antipodal number of graphs
by: Arockiaraj, S.; Department of Mathematics, Government Arts $\&$ Science College, Sivakasi 626124, Tamil Nadu, India, et al.
Published: (2019) -
Bounds for graph energy in terms of vertex covering and clique numbers
by: Ganie, Hilal A.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India, et al.
Published: (2019)