|
Open packing number for some classes of perfect graphs
K. Raja Chandrasekara, S. Saravanakumarb a Amrita College of Engineering and Technology, Amritagiri, Erachakulam Post, Nagercoil-629902, Tamil Nadu, India
b Kalasalingam Academy of Research and Education, Anand Nagar, Krishnankoil-626126, Tamil Nadu, India
Аннотация:
Let $G$ be a graph with the vertex set $V(G)$. A subset $S$ of $V(G)$ is an open packing set of $G$ if every pair of vertices in $S$ has no common neighbor in $G.$ The maximum cardinality of an open packing set of $G$ is the open packing number of $G$ and it is denoted by $\rho^o(G)$. In this paper, the exact values of the open packing numbers for some classes of perfect graphs, such as split graphs, $\{P_4, C_4\}$-free graphs, the complement of a bipartite graph, the trestled graph of a perfect graph are obtained.
Ключевые слова:
open packing number, 2-packing number, perfect graphs, trestled graphs.
Образец цитирования:
K. Raja Chandrasekar, S. Saravanakumar, “Open packing number for some classes of perfect graphs”, Ural Math. J., 6:2 (2020), 38–43
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/umj124 https://www.mathnet.ru/rus/umj/v6/i2/p38
|
Статистика просмотров: |
Страница аннотации: | 80 | PDF полного текста: | 24 | Список литературы: | 11 |
|