Capa do livro de Some Studies on Dominating Sets and Restrained Dominating Sets
Título do livro:

# Some Studies on Dominating Sets and Restrained Dominating Sets

## Some Studies on Dominating Sets and Restrained Dominating Sets of Interval Graphs and Circular – Arc Graphs

GlobeEdit (2021-02-13 )

Apto para vale
ISBN- 1 3:

### 978-620-0-61991-4

ISBN- 1 0:
6200619913
EAN:
9786200619914
Idioma do livro:
Inglês
Anotações e citações/ texto breve:
In general an undirected graph is an interval graph (IG), if the vertex set V can be put into one-to-one correspondence with a set of intervals on the real line , such that two vertices are adjacent in G if and only if their corresponding intervals have non-empty intersection. The set I is called an interval representation of G and G is referred to as the intersection graph Let be any interval family where, each is an interval on the real line and , for . Here is called the left end point labeling and is the right end point labeling of . Circular - arc graphs are introduced as generalization of Interval graphs. If we bend the real line into a circle, then any family of intervals of the real line is transformed into a family of arcs of the circle. Therefore, every interval graph is a circular - arc graph. But, the converse need not be true. However both these classes of graphs have received considerable attention in the literature in recent years and have been studied extensively. A circular - arc graph is the intersection graph of a set of arcs on the circle.
Editora:
GlobeEdit
Website:
https://www.globeedit.com
Por (autor):
Anupalli Sudhakaraiah, E. Gnana Deepika
Número de páginas:
160
2021-02-13
Stock:
Disponível
Categoria:
Matemática
Preço:
64.9 €
Palavras chave:
Dominating set, Restrained Dominating set, Interval graph, Circular-arc graph