56
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Packing in regular graphs

&
Pages 693-706 | Received 15 May 2017, Published online: 10 Nov 2017

References

  • J. Akiyama, G. Exoo, and F. Harary, Covering and packing in graphs III: Cyclic and acyclic invariants, Math. Slovaca 30 (1980), 405–417.
  • H.J. Broersma and A.A. Jagers, The unique 4-regular graphs on 14 and 15 vertices with diameter 2, Ars Combin. 25(C) (1988), 55–62.
  • B. Elspas, Topological constraints on interconnection-limited logic, Proc. IEEE Fifth Symposium on Switching Circuit Theory and Logical Design, IEEE S164 (1964), 133–147.
  • P. Erdős, S. Fajtlowicz, and A.J. Hoffman, Maximum degree in graphs of diameter 2, Networks 10 (1980), 87–90. doi: 10.1002/net.3230100109
  • S. Fajtlowicz, On the size of independent sets in graphs, Congr. Numer. 21 (1978), 269–274.
  • S. Fajtlowicz, Independence, clique size and maximum degree, Combinatorica 4 (1984), 35–38. doi: 10.1007/BF02579154
  • S. Fajtlowicz, Graphs of diameter 2 with cyclic defect, Colloq. Math. 51 (1987), 103–106. doi: 10.4064/cm-51-1-103-106
  • O. Favaron, Signed domination in regular graphs, Discrete Math. 158 (1996), 287–293. doi: 10.1016/0012-365X(96)00026-X
  • F. Harary, Covering and packing in graphs, I, Annals of the New York Academy of Sciences 175 (1970), 198–205. doi: 10.1111/j.1749-6632.1970.tb56470.x
  • T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
  • M.A. Henning, C. Löwenstein, J. Southey, and A. Yeo, A new lower bound on the independence number of a graph and applications, Electronic J. Combin. 21(1) (2014), P1.38.
  • M.A. Henning and A. Yeo, Total domination in graphs (Springer Monographs in Mathematics), 2013. ISBN: 978-1-4614-6524-9 (Print) 978-1-4614-6525-6 (Online).
  • A.J. Hoffman and R.R. Singleton, On Moore graphs with diameter 2 and 3, IBM J. of Research and Development 5 (1960), 497–504. doi: 10.1147/rd.45.0497
  • W. Klostermeyer, A taxonomy of perfect domination, J. Discrete Math. Sci. Cryptography 18 (2015), 105–116. doi: 10.1080/09720529.2014.914288
  • A. Meir and J.W. Moon, Relations between packing and covering numbers of a tree, Pacific J.Math. 61 (1975), 225–233. doi: 10.2140/pjm.1975.61.225
  • M. Miller and J. Širáň, Moore graphs and beyond: A survey of the degree/diameter problem, Electronic J. Combin. 20(2) (2013), #DS14v2.
  • M.H. Nguyen and M. Miller, Structural properties of graphs of diameter 2 with defect 2, AKCE International J. Graphs Combin. 7(1) (2010), 29–43.
  • R.R. Singleton, There is no irregular Moore graph, Amer. Math. Monthly 75 (1968), 42–43. doi: 10.2307/2315106

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.