Independent Dominator Sequence Number of a Graph
Copyright policy )Independent Dominator Sequence Number of a Graph
AbstractLet G = (V, E) be a connected graph. A dominator sequence in G is a sequence of vertices S = (v1, v2,. . ., vk) such that for each i with 2 ≤ i ≤ k, the vertex vi dominates at least one vertex which is not dominated by v1, v2,. . ., vi−1. If further the set of vertices in S is an independent set, then S is called an independent dominator sequence (IDS) in G. The maximum length of an IDS in G is called the independent dominator sequence number of G and is denoted by lι(G). In this paper we initiate a study of this parameter.
- Kalasalingam Academy of Research and Education India
- Vellore Institute of Technology University India
- University of Oklahoma United States
independent dominator sequence, independent dominator sequence number., Dominator sequence, dominator sequence number
independent dominator sequence, independent dominator sequence number., Dominator sequence, dominator sequence number
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).1 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
Citations provided by BIP!Popularity provided by BIP!