On the minimum order of 4-lazy cops-win graphs
We consider the minimum order of a graph G with a given lazy cop number c L (G). Sullivan, Townsend and Werzanski [7] showed that the minimum order of a connected graph with lazy cop number 3 is 9 and K 3 □K 3 is the unique graph on nine vertices which requires three lazy cops. They conjectured that...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | 論文 |
| 出版事項: |
Korean Mathematical Society
2018
|
| 主題: | |
| オンライン･アクセス: | http://eprints.um.edu.my/20660/ http://pdf.medrang.co.kr/kms01/BKMS/55/BKMS-55-6-1667-1690.pdf |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|