Erudition on Ladder Network and Prolonged Ladder Network – Semigraph Approach
Thiagarajan K1, Mansoor P2

1Thiagarajan K, Professor – Academic Research, Jeppiaar Engineering College, Chennai, Tamilnadu, India.
2Mansoor P, Research Scholar (Ph.D-CB-0343 – DEC – 2013), Research and Development Centre, Bharathiar University, Coimbatore, Tamilnadu, India.

Manuscript received on 02 June 2019 | Revised Manuscript received on 10 June 2019 | Manuscript published on 30 June 2019 | PP: 1096-1098 | Volume-8 Issue-8, June 2019 | Retrieval Number: H6587068819/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Let u1, u2, …, um and v1, v2, …, v be two paths on m nodes, For i = 1,2, … , m if we link the nodes u1 and  v2 by an edge e, then the new graph obtained is called a
Ladder network which denoted by L2m,m ≥1. A ladder network can be expanded by introducing semi nodes to each of its edges. This paper introduces an expression for the domination number of a ladder network in terms of the number of internal steps of the ladder and attempts to study some properties of expanded ladder networks obtained by introducing semi nodes to its steps, that is, the edges connecting the nodes of the paths.
Keyword: Ladder network, Domination number, Expanded ladder network, Roman domination number.

Scope of the Article: Networked-Driven Multicourse Chips.