Inverse Domination Parameters of Jump Graph
Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a dominating set D^\prime of G, then D^\prime is called an inverse dominating set with respect to D. Theminimum cardinality of an inverse dominating set of G is called inverse domination number of G. In this...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Accademia Piceno Aprutina dei Velati
2023-01-01
|
| Series: | Ratio Mathematica |
| Subjects: | |
| Online Access: | http://eiris.it/ojs/index.php/ratiomathematica/article/view/1001 |
| _version_ | 1811159335622934528 |
|---|---|
| author | S Santha G.T Krishna Veni |
| author_facet | S Santha G.T Krishna Veni |
| author_sort | S Santha |
| collection | DOAJ |
| description | Let G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a dominating set D^\prime of G, then D^\prime is called an inverse dominating set with respect to D. Theminimum cardinality of an inverse dominating set of G is called inverse domination number of G. In this article, we determine inverse domination parameters of jump graph of a graph. |
| first_indexed | 2024-04-10T05:39:20Z |
| format | Article |
| id | doaj.art-de2f9647c7024744bebee4eb2562d88f |
| institution | Directory Open Access Journal |
| issn | 1592-7415 2282-8214 |
| language | English |
| last_indexed | 2024-04-10T05:39:20Z |
| publishDate | 2023-01-01 |
| publisher | Accademia Piceno Aprutina dei Velati |
| record_format | Article |
| series | Ratio Mathematica |
| spelling | doaj.art-de2f9647c7024744bebee4eb2562d88f2023-03-06T14:24:41ZengAccademia Piceno Aprutina dei VelatiRatio Mathematica1592-74152282-82142023-01-0145010.23755/rm.v45i0.1001703Inverse Domination Parameters of Jump GraphS Santha0G.T Krishna Veni1Department of Mathematics, Government Arts and Science, Konam, Nagercoil-629004, Kanyakumari Dt, Tamil Nadu, IndiaResearch Dept. of Mathematics, Rani Anna Govt. College for Women, Tirunelveli-8, Affiliated to Manonmaniam Sundaranar University, Abishekapatti, Tirunelveli-627012, Tamil Nadu, IndiaLet G=(V,E)\ be a connected graph. Let D be a minimum dominating set in G.\ If V-D contains a dominating set D^\prime of G, then D^\prime is called an inverse dominating set with respect to D. Theminimum cardinality of an inverse dominating set of G is called inverse domination number of G. In this article, we determine inverse domination parameters of jump graph of a graph.http://eiris.it/ojs/index.php/ratiomathematica/article/view/1001dominating set, labeling, digraphs, di-cyclic, di-quadrilateral, di-pentagonal, snake. |
| spellingShingle | S Santha G.T Krishna Veni Inverse Domination Parameters of Jump Graph Ratio Mathematica dominating set, labeling, digraphs, di-cyclic, di-quadrilateral, di-pentagonal, snake. |
| title | Inverse Domination Parameters of Jump Graph |
| title_full | Inverse Domination Parameters of Jump Graph |
| title_fullStr | Inverse Domination Parameters of Jump Graph |
| title_full_unstemmed | Inverse Domination Parameters of Jump Graph |
| title_short | Inverse Domination Parameters of Jump Graph |
| title_sort | inverse domination parameters of jump graph |
| topic | dominating set, labeling, digraphs, di-cyclic, di-quadrilateral, di-pentagonal, snake. |
| url | http://eiris.it/ojs/index.php/ratiomathematica/article/view/1001 |
| work_keys_str_mv | AT ssantha inversedominationparametersofjumpgraph AT gtkrishnaveni inversedominationparametersofjumpgraph |