Independent Dominator Sequence Number of a Graph | Zendy

S. Arumugam | Zendy; B. Jayaram | Zendy; K. Thulasiraman | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Independent Dominator Sequence Number of a Graph

Author(s) -

S. Arumugam,

B. Jayaram,

K. Thulasiraman

Publication year - 2015

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2015.12.073

Subject(s) - combinatorics , vertex (graph theory) , sequence (biology) , graph , computer science , mathematics , discrete mathematics , biology , genetics

Let 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research