On efficient absorbant conjecture in generalized De Bruijn digraphs

References

• D.W. Bange, A.E. Barkauskas, and P.J. Slater, Efficient dominating sets in graphs, in Applications of Discrete Mathematics, R.D. Ringeisen and F.S. Roberts, eds., SIAM, Philadelphia, 1988, pp. 189–199.
   Google Scholar
• J.-C. Bermond and C. Peyrat, De Bruijn and Kautz networks: A competitor for the hypercube? in Hypercube and Distributed Computers, F. Andrè and J.P. Verjus, eds., Elsevier Science Publishers B.V., North-Holland, 1989, pp. 279–293.
   Google Scholar
• A. Brandstädt and V.B. Le, A note on efficient domination in a superclass of P5-free graphs, Inform. Process. Lett. 114 (2014), pp. 357–359. doi: 10.1016/j.ipl.2014.02.007
   Web of Science ®Google Scholar
• M. Chellali, O. Favaron, T.W. Haynes, S.T. Hedetniemi, and A. McRae, Independent [1k]-sets in graphs, Australas. J. Combin. 59 (2014), pp. 144–156.
   Google Scholar
• T.T. Chelvam and S. Mutharasu, Subgroups as efficient dominating sets in Cayley graphs, Discrete Appl. Math. 161 (2003), pp. 1187–1190. doi: 10.1016/j.dam.2012.09.005
   Web of Science ®Google Scholar
• I.J. Dejter, Perfect domination in regular grid graphs, Australas. J. Combin. 42 (2008), pp. 99–114.
   Google Scholar
• I.J. Dejter, Worst-case efficient dominating sets in digraphs, Discrete Appl. Math. 161 (2013), pp. 944–952. doi: 10.1016/j.dam.2012.11.016
   Web of Science ®Google Scholar
• I.J. Dejter and O. Serra, Efficient dominating sets in Cayley graphs, Discrete Appl. Math. 129 (2003), pp. 319–328. doi: 10.1016/S0166-218X(02)00573-5
   Web of Science ®Google Scholar
• Y.-P. Deng, Efficient dominating sets in circulant graphs with domination number prime, Inform. Process. Lett. 114 (2014), pp. 700–702. doi: 10.1016/j.ipl.2014.06.008
   Web of Science ®Google Scholar
• D.Z. Du, D.F. Hsu, and F.K. Hwang, Doubly-linked ring networks, IEEE Trans. Comput. C-34 (1985), pp. 1025–1035. doi: 10.1109/TC.1985.1676641
   Web of Science ®Google Scholar
• D.Z. Du and F.K. Hwang, Generalized De Bruijn digraphs, Networks 18 (1988), pp. 27–38. doi: 10.1002/net.3230180105
   Web of Science ®Google Scholar
• A.H. Esfahanian and S.L. Hakimi, Fault-tolerant routing in DeBruijn communication networks, IEEE Trans. Comput. C-34 (1985), pp. 777–788. doi: 10.1109/TC.1985.1676633
   Web of Science ®Google Scholar
• D. Ferrero and F. Harary, Edge sums of De Bruijn interconnection networks, Int. J. Comput. Math. 80 (2003), pp. 819–824. doi: 10.1080/0020716031000087159a
   Web of Science ®Google Scholar
• J. Huang and J.-M. Xu, The bondage numbers and efficient dominations of vertex-transitive graphs, Discrete Math. 308 (2008), pp. 571–582. doi: 10.1016/j.disc.2007.03.027
   Web of Science ®Google Scholar
• M. Imase and M. Itoh, Design to minimize diameter on buildingblock network, IEEE Trans. Comput. C-30 (1981), pp. 439–442. doi: 10.1109/TC.1981.1675809
   Web of Science ®Google Scholar
• M. Imase and M. Itoh, A design for directed graphs with minimum diameter, IEEE Trans. Comput. C-32 (1983), pp. 782–784. doi: 10.1109/TC.1983.1676323
   Web of Science ®Google Scholar
• M. Imase, T. Soneoka, and K. Okada, Connectivity of regular directed graphs with small diameters, IEEE Trans. Comput. C-34 (1985), pp. 267–273. doi: 10.1109/TC.1985.1676569
   Web of Science ®Google Scholar
• S. Klavzar, S. Spacapan, and J. Zerovnik, An almost complete description of perfect codes in direct products of cycles, Adv. in Appl. Math. 37 (2006), pp. 2–18. doi: 10.1016/j.aam.2005.10.002
   Web of Science ®Google Scholar
• M. Knor and P. Potocnik, Efficient domination in cubic vertex-transitive graphs, European J. Combin. 33 (2012), pp. 1755–1764. doi: 10.1016/j.ejc.2012.04.007
   Web of Science ®Google Scholar
• J. Kratochvl, Perfect codes of graphs, J. Combin. Theory Ser. B 40 (1986), pp. 224–228. doi: 10.1016/0095-8956(86)90079-1
   Web of Science ®Google Scholar
• K.R. Kumar and G. MacGillivray, Efficient domination in circulant graphs, Discrete Math. 313 (2013), pp. 767–771. doi: 10.1016/j.disc.2012.12.003
   Web of Science ®Google Scholar
• J. Lee, Independent perfect domination sets in Cayley graphs, J. Graph Theory 37 (2001), pp. 213–219. doi: 10.1002/jgt.1016
   Web of Science ®Google Scholar
• M. Mollard, On perfect codes in Cartesian products of graphs, European J. Combin. 32 (2011), pp. 398–403. doi: 10.1016/j.ejc.2010.11.007
   Web of Science ®Google Scholar
• J. Ou and J. Li, On m-restricted edge connectivity of undirected generalized De Bruijn graphs, Int. J. Comput. Math. 90 (2013), pp. 2259–2264. doi: 10.1080/00207160.2013.778984
   Web of Science ®Google Scholar
• S.M. Reddy, D.K. Pradhan, and J.G. Kuhl, Direct graphs with minimum diameter and maximal connectivity, School of Engineering, Oakland University Tech. Rep., July 1980.
   Google Scholar
• E. Shan, T.C.E. Cheng, and L. Kang, Absorbant of generalized De Bruijn digraphs, Inform. Process. Lett. 105 (2007), pp. 6–11. doi: 10.1016/j.ipl.2007.07.007
   Web of Science ®Google Scholar
• Y.-L. Wang, Efficient twin domination in generalized De Bruijn digraphs, Discrete Math. 338 (2015), pp. 36–40. doi: 10.1016/j.disc.2014.10.014
   Web of Science ®Google Scholar
• Y.L. Wang, K.H. Wu, and T. Kloks, On perfect absorbants in generalized De Bruijn digraphs, Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM, 2013, pp. 303–314.
   Google Scholar