Fractional distance domination in graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2012 English Publisher:University of Zielona Góra, PolandJournal:Discussiones Mathematicae Graph Theory, volume 32, page 449 (issn: 1234-3099, eissn: 2083-5892,

Copyright policy )

Authors: S. Arumugam 0001; Kalimuthu Karuppasamy; Varughese Mathew;

doi: 10.7151/dmgt.1609

Fractional distance domination in graphs

- Summary
- Metrics

Abstract

Let G = (V,E) be a connected graph and let k be a positive integer with k ≤ rad(G). A subset D ⊆ V is called a distance k-dominating set of G if for every v ∈ V − D, there exists a vertex u ∈ D such that d(u,v) ≤ k. In this paper we study the fractional version of distance k-domination and related parameters.

Related Organizations

University of Newcastle Australia
Australia
Kalasalingam Academy of Research and Education
India

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average