arXiv:1808.01827 [math.CO]AbstractReferencesReviewsResources Efficient domination in regular graphs Misa Nakanishi Published 2018-08-06Version 1 In this paper, we study efficient domination in regular graphs. Categories: math.CO Keywords: regular graphs, study efficient domination Related articles: Most relevant | Search more arXiv:1401.0836 [math.CO] (Published 2014-01-04) Sequential edge-coloring on the subset of vertices of almost regular graphs Petros A. Petrosyan arXiv:math/0610742 [math.CO] (Published 2006-10-25, updated 2007-08-30) Clustering of spectra and fractals of regular graphs V. Ejov, J. A. Filar, S. K. Lucas, P. Zograf arXiv:1210.8273 [math.CO] (Published 2012-10-31, updated 2014-06-12) Regular graphs with maximal energy per vertex Edwin R. van Dam, Willem H. Haemers, Jack H. Koolen Links Abstract on arXiv.org View preprint PDF Download TeX source Export citation in BibTeX Save eprint metadata as JSON Toolbox Post your review for this article Attach supplementary resources Edit our extended metadata Share this article on social media FacebookGoogle+LinkedInRedditTwitterVK Scan the QR code for this page
![QR code for arXiv:1808.01827 [math.CO]](http://oss.arxitics.com/images/favicon.svg)