Equitably strong non-split equitable domination in graphs
Abstract In a simple, finite and undirected graph G with vertex set V and edge set E, Prof. Sampathkumar defined degree equitability among vertices of G. Two vertices u and v are said to be degree equitable if |deg(u) − deg(v)| ≤ 1. Equitable domination has been defined and studi...
Guardado en:
| Autores principales: | , , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2021
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000400989 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| id |
oai:scielo:S0716-09172021000400989 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scielo:S0716-091720210004009892021-08-12Equitably strong non-split equitable domination in graphsNataraj,P.Sundareswaran,R.Swaminathan,V. Equitable domination Split domination Strong non-split domination Abstract In a simple, finite and undirected graph G with vertex set V and edge set E, Prof. Sampathkumar defined degree equitability among vertices of G. Two vertices u and v are said to be degree equitable if |deg(u) − deg(v)| ≤ 1. Equitable domination has been defined and studied in [7]. V.R. Kulli and B. Janakiram defined strong non - split domination in a graph [5]. In this paper, the equitable version of this new type of domination is studied.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.40 n.4 20212021-01-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000400989en10.22199/issn.0717-6279-4497 |
| institution |
Scielo Chile |
| collection |
Scielo Chile |
| language |
English |
| topic |
Equitable domination Split domination Strong non-split domination |
| spellingShingle |
Equitable domination Split domination Strong non-split domination Nataraj,P. Sundareswaran,R. Swaminathan,V. Equitably strong non-split equitable domination in graphs |
| description |
Abstract In a simple, finite and undirected graph G with vertex set V and edge set E, Prof. Sampathkumar defined degree equitability among vertices of G. Two vertices u and v are said to be degree equitable if |deg(u) − deg(v)| ≤ 1. Equitable domination has been defined and studied in [7]. V.R. Kulli and B. Janakiram defined strong non - split domination in a graph [5]. In this paper, the equitable version of this new type of domination is studied. |
| author |
Nataraj,P. Sundareswaran,R. Swaminathan,V. |
| author_facet |
Nataraj,P. Sundareswaran,R. Swaminathan,V. |
| author_sort |
Nataraj,P. |
| title |
Equitably strong non-split equitable domination in graphs |
| title_short |
Equitably strong non-split equitable domination in graphs |
| title_full |
Equitably strong non-split equitable domination in graphs |
| title_fullStr |
Equitably strong non-split equitable domination in graphs |
| title_full_unstemmed |
Equitably strong non-split equitable domination in graphs |
| title_sort |
equitably strong non-split equitable domination in graphs |
| publisher |
Universidad Católica del Norte, Departamento de Matemáticas |
| publishDate |
2021 |
| url |
http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172021000400989 |
| work_keys_str_mv |
AT natarajp equitablystrongnonsplitequitabledominationingraphs AT sundareswaranr equitablystrongnonsplitequitabledominationingraphs AT swaminathanv equitablystrongnonsplitequitabledominationingraphs |
| _version_ |
1718439912511897600 |