Geodetic Global Domination in the Join of Two Graphs
A set S of vertices in a connected graph is called a geodetic set if every vertex not in lies on a shortest path between two vertices from . A set of vertices in is called a dominating set of if every vertex not in has at least one neighbor in . A set is called a geodetic global dominating set of if...
Gespeichert in:
| Veröffentlicht in: | International journal of recent technology and engineering 2020-01, Vol.8 (5), p.4579-4583 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 4583 |
|---|---|
| container_issue | 5 |
| container_start_page | 4579 |
| container_title | International journal of recent technology and engineering |
| container_volume | 8 |
| creator | Xaviour, X. Lenin Chellathurai, S. Robinson |
| description | A set S of vertices in a connected graph is called a geodetic set if every vertex not in lies on a shortest path between two vertices from . A set of vertices in is called a dominating set of if every vertex not in has at least one neighbor in . A set is called a geodetic global dominating set of if is both geodetic and global dominating set of . The geodetic global dominating number is the minimum cardinality of a geodetic global dominating set in . In this paper we determine the geodetic global domination number of the join of two graphs. |
| doi_str_mv | 10.35940/ijrte.E6770.018520 |
| format | Article |
| fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_35940_ijrte_E6770_018520</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_35940_ijrte_E6770_018520</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1390-7169351f58dd0022e1f49e6d8dc5777870a701b02ce3cd50bc018b0bbaacf9db3</originalsourceid><addsrcrecordid>eNpNz81KAzEcBPAgCpbaJ_CSF9j1n2SzyR6l1lUpeKnnkE-ast2UZEF8e8u2h55mTsP8EHomUDPeNfASD3ny9aYVAmogklO4QwtKhaiYFPL-pj-iVSkHACCsJQ1rF6jpfXJ-ihb3QzJ6wG_pGEc9xTTiOOJp7_FXOpcU8O434T7r0748oYegh-JX11yin_fNbv1Rbb_7z_XrtrKEdVAJ0naMk8ClcwCUehKazrdOOsuFEFKAFkAMUOuZdRyMPb83YIzWNnTOsCVil12bUynZB3XK8ajznyKgZrua7Wq2q4ud_QMgfEzc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Geodetic Global Domination in the Join of Two Graphs</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Xaviour, X. Lenin ; Chellathurai, S. Robinson</creator><creatorcontrib>Xaviour, X. Lenin ; Chellathurai, S. Robinson ; Research Scholar, RegNo: 17213162091021, Department of Mathematics, Scott Christian College, Nagercoil ; Associate Professor, Department of Mathematics, Scott Christian College, Nagercoil - 629003,Tamil Nadu, India</creatorcontrib><description>A set S of vertices in a connected graph is called a geodetic set if every vertex not in lies on a shortest path between two vertices from . A set of vertices in is called a dominating set of if every vertex not in has at least one neighbor in . A set is called a geodetic global dominating set of if is both geodetic and global dominating set of . The geodetic global dominating number is the minimum cardinality of a geodetic global dominating set in . In this paper we determine the geodetic global domination number of the join of two graphs.</description><identifier>ISSN: 2277-3878</identifier><identifier>EISSN: 2277-3878</identifier><identifier>DOI: 10.35940/ijrte.E6770.018520</identifier><language>eng</language><ispartof>International journal of recent technology and engineering, 2020-01, Vol.8 (5), p.4579-4583</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1390-7169351f58dd0022e1f49e6d8dc5777870a701b02ce3cd50bc018b0bbaacf9db3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Xaviour, X. Lenin</creatorcontrib><creatorcontrib>Chellathurai, S. Robinson</creatorcontrib><creatorcontrib>Research Scholar, RegNo: 17213162091021, Department of Mathematics, Scott Christian College, Nagercoil</creatorcontrib><creatorcontrib>Associate Professor, Department of Mathematics, Scott Christian College, Nagercoil - 629003,Tamil Nadu, India</creatorcontrib><title>Geodetic Global Domination in the Join of Two Graphs</title><title>International journal of recent technology and engineering</title><description>A set S of vertices in a connected graph is called a geodetic set if every vertex not in lies on a shortest path between two vertices from . A set of vertices in is called a dominating set of if every vertex not in has at least one neighbor in . A set is called a geodetic global dominating set of if is both geodetic and global dominating set of . The geodetic global dominating number is the minimum cardinality of a geodetic global dominating set in . In this paper we determine the geodetic global domination number of the join of two graphs.</description><issn>2277-3878</issn><issn>2277-3878</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNpNz81KAzEcBPAgCpbaJ_CSF9j1n2SzyR6l1lUpeKnnkE-ast2UZEF8e8u2h55mTsP8EHomUDPeNfASD3ny9aYVAmogklO4QwtKhaiYFPL-pj-iVSkHACCsJQ1rF6jpfXJ-ihb3QzJ6wG_pGEc9xTTiOOJp7_FXOpcU8O434T7r0748oYegh-JX11yin_fNbv1Rbb_7z_XrtrKEdVAJ0naMk8ClcwCUehKazrdOOsuFEFKAFkAMUOuZdRyMPb83YIzWNnTOsCVil12bUynZB3XK8ajznyKgZrua7Wq2q4ud_QMgfEzc</recordid><startdate>20200130</startdate><enddate>20200130</enddate><creator>Xaviour, X. Lenin</creator><creator>Chellathurai, S. Robinson</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20200130</creationdate><title>Geodetic Global Domination in the Join of Two Graphs</title><author>Xaviour, X. Lenin ; Chellathurai, S. Robinson</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1390-7169351f58dd0022e1f49e6d8dc5777870a701b02ce3cd50bc018b0bbaacf9db3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Xaviour, X. Lenin</creatorcontrib><creatorcontrib>Chellathurai, S. Robinson</creatorcontrib><creatorcontrib>Research Scholar, RegNo: 17213162091021, Department of Mathematics, Scott Christian College, Nagercoil</creatorcontrib><creatorcontrib>Associate Professor, Department of Mathematics, Scott Christian College, Nagercoil - 629003,Tamil Nadu, India</creatorcontrib><collection>CrossRef</collection><jtitle>International journal of recent technology and engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Xaviour, X. Lenin</au><au>Chellathurai, S. Robinson</au><aucorp>Research Scholar, RegNo: 17213162091021, Department of Mathematics, Scott Christian College, Nagercoil</aucorp><aucorp>Associate Professor, Department of Mathematics, Scott Christian College, Nagercoil - 629003,Tamil Nadu, India</aucorp><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Geodetic Global Domination in the Join of Two Graphs</atitle><jtitle>International journal of recent technology and engineering</jtitle><date>2020-01-30</date><risdate>2020</risdate><volume>8</volume><issue>5</issue><spage>4579</spage><epage>4583</epage><pages>4579-4583</pages><issn>2277-3878</issn><eissn>2277-3878</eissn><abstract>A set S of vertices in a connected graph is called a geodetic set if every vertex not in lies on a shortest path between two vertices from . A set of vertices in is called a dominating set of if every vertex not in has at least one neighbor in . A set is called a geodetic global dominating set of if is both geodetic and global dominating set of . The geodetic global dominating number is the minimum cardinality of a geodetic global dominating set in . In this paper we determine the geodetic global domination number of the join of two graphs.</abstract><doi>10.35940/ijrte.E6770.018520</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2277-3878 |
| ispartof | International journal of recent technology and engineering, 2020-01, Vol.8 (5), p.4579-4583 |
| issn | 2277-3878 2277-3878 |
| language | eng |
| recordid | cdi_crossref_primary_10_35940_ijrte_E6770_018520 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| title | Geodetic Global Domination in the Join of Two Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T20%3A18%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Geodetic%20Global%20Domination%20in%20the%20Join%20of%20Two%20Graphs&rft.jtitle=International%20journal%20of%20recent%20technology%20and%20engineering&rft.au=Xaviour,%20X.%20Lenin&rft.aucorp=Research%20Scholar,%20RegNo:%2017213162091021,%20Department%20of%20Mathematics,%20Scott%20Christian%20College,%20Nagercoil&rft.date=2020-01-30&rft.volume=8&rft.issue=5&rft.spage=4579&rft.epage=4583&rft.pages=4579-4583&rft.issn=2277-3878&rft.eissn=2277-3878&rft_id=info:doi/10.35940/ijrte.E6770.018520&rft_dat=%3Ccrossref%3E10_35940_ijrte_E6770_018520%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |