CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
On the Independent Domination Number of Regular Graphs
Authors
Wayne Goddard
Michael A. Henning
Jeremy Lyle
Justin Southey
Publication date
1 December 2012
Publisher
The Aquila Digital Community
Abstract
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we consider questions about independent domination in regular graphs
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Aquila Digital Community
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:aquila.usm.edu:fac_pubs-87...
Last time updated on 17/04/2020