A PHP Error was encountered

Severity: Notice

Message: Only variable references should be returned by reference

Filename: core/Common.php

Line Number: 257

Journal of Excellence in Computer Science and Engineering

Archives


Rate this Article: (0) Votes

Research Article

Year : 2018 | Volume: 4 | Issue: 2 | Pages: 29-34

Restrained Steiner Number of Some Special Graphs

M S Malchijah Raj1*, 2

http://dx.doi.org/doi:10.18831/djcse.in/12018021003

Corresponding author

M S Malchijah Raj*

Research Scholar, Research and Development Centre, Bharathiar University, Coimbatore 641046, India.

  • 1. Research Scholar, Research and Development Centre, Bharathiar University, Coimbatore 641046, India.

Received on: 2018/02/08

Revised on: 2018/02/28

Accepted on: 2018/03/26

Published on: 2018/04/13

Abstract

A set W of vertices of a graph G is a restrained Steiner set if W is a Steiner set, and if either W=V or the subgraph G[V-W] induced by V-W has no isolated vertices. The minimum cardinality of a restrained Steiner set of G is the restrained Steiner number of G, and is denoted by sr(G). This article explores the restrained Steiner number of some special graphs.

Keywords

Steiner set, Steiner number, Isolated vertices, Restrained Steiner number, Special graphs.