We gratefully acknowledge support from
the Simons Foundation
and member institutions
Full-text links:

Download:

Current browse context:

cs.DM

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo ScienceWISE logo

Computer Science > Discrete Mathematics

Title: Maximum matchings and minimum dominating sets in Apollonian networks and extended Tower of Hanoi graphs

Abstract: The Apollonian networks display the remarkable power-law and small-world properties as observed in most realistic networked systems. Their dual graphs are extended Tower of Hanoi graphs, which are obtained from the Tower of Hanoi graphs by adding a special vertex linked to all its three extreme vertices. In this paper, we study analytically maximum matchings and minimum dominating sets in Apollonian networks and their dual graph- s, both of which have found vast applications in various fields, e.g. structural controllability of complex networks. For both networks, we determine their matching number, domination number, the number of maximum matchings, as well as the number of minimum dominating sets.
Subjects: Discrete Mathematics (cs.DM); Combinatorics (math.CO)
DOI: 10.1016/j.tcs.2017.08.024
Cite as: arXiv:1709.04404 [cs.DM]
  (or arXiv:1709.04404v1 [cs.DM] for this version)

Submission history

From: Huan Li [view email]
[v1] Wed, 13 Sep 2017 16:17:00 GMT (840kb)