Skip to content
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Publication Details
AFRICAN RESEARCH NEXUS
SHINING A SPOTLIGHT ON AFRICAN RESEARCH
mathematics
On α-total domination in graphs
Discrete Applied Mathematics, Volume 160, No. 7-8, Year 2012
Notification
URL copied to clipboard!
Description
Let G=(V,E) be a graph with no isolated vertex. A subset of vertices S is a total dominating set if every vertex of G is adjacent to some vertex of S. For some α with 0<α≤1, a total dominating set S in G is an α-total dominating set if for every vertex v∈V\S, |N(v)∩S|≥α|N(v)|. The minimum cardinality of an α-total dominating set of G is called the α-total domination number of G. In this paper, we study α-total domination in graphs. We obtain several results and bounds for the α-total domination number of a graph G. © 2011 Elsevier B.V. All rights reserved.
Authors & Co-Authors
Henning, Michael A.
South Africa, Johannesburg
University of Johannesburg
Jafari Rad, Nader Jafari
Iran, Shahrood
Shahrood University of Technology
Statistics
Citations: 84
Authors: 2
Affiliations: 2
Identifiers
Doi:
10.1016/j.dam.2011.11.021
ISSN:
0166218X