Поиск по каталогу |
(строгое соответствие)
|
- Профессиональная
- Научно-популярная
- Художественная
- Публицистика
- Детская
- Искусство
- Хобби, семья, дом
- Спорт
- Путеводители
- Блокноты, тетради, открытки
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
В наличии
Местонахождение: Алматы | Состояние экземпляра: новый |
Бумажная
версия
версия
Автор: Anupalli Sudhakaraiah and E. Gnana Deepika
ISBN: 9786200619914
Год издания: 1905
Формат книги: 60×90/16 (145×215 мм)
Количество страниц: 160
Издательство: GlobeEdit
Цена: 38860 тг
Положить в корзину
Способы доставки в город Алматы * комплектация (срок до отгрузки) не более 2 рабочих дней |
Самовывоз из города Алматы (пункты самовывоза партнёра CDEK) |
Курьерская доставка CDEK из города Москва |
Доставка Почтой России из города Москва |
Аннотация: 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.
Ключевые слова: Dominating set, Restrained Dominating set, Interval graph, Circular-arc graph
Похожие издания
Отрасли знаний: Точные науки -> Математика Makke Siva Parvathi and Bommireddy Maheswari Some Studies on Dominating Functions of Corona Product Graphs. . 2018 г., 160 стр., мягкий переплет The origin of Graph Theory is supposed to be traced from the study of Konigsberg bridge problem during 1736 by the great mathematician Leonard Euler. That attracted many mathematicians to contribute much more in the study of graph theory. The first book on graph theory was published in 1936 by D. Konig. Since then relatively in a short period,... | 32569 тг | |
Отрасли знаний: Точные науки -> Математика Anupalli Sudhakaraiah and V. Ramalatha Studies On Dominating Sets Of I G & C A Graphs Using Algorithms. Some Studies On Dominating Sets Of Interval Graphs And Circular-arc Graphs Using Algorithms And Networks. 2014 г., 180 стр., мягкий переплет Research in graph theory and its applications have increased considerably in recent years. Typically, the elaboration of new theoretical structures has motivated a research for new algorithms compatible with those structures. Rather than the arduous and systematic study of every new concept definable with a graph corresponding Interval graph as... | 42959 тг |