Computing Edge Weights of Magic Labeling on Rooted Products of Graphs
Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications in the fields of civil, software, electrical, and network engineering. For example, in network engineering, any systems interconnected in a network can be converted into a graph and specific numeric l...
Gespeichert in:
| Veröffentlicht in: | Mathematical problems in engineering 2020, Vol.2020 (2020), p.1-16 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 16 |
|---|---|
| container_issue | 2020 |
| container_start_page | 1 |
| container_title | Mathematical problems in engineering |
| container_volume | 2020 |
| creator | Liu, Jia-Bao Javaid, Muhammad Afzal, Hafiz Usman |
| description | Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications in the fields of civil, software, electrical, and network engineering. For example, in network engineering, any systems interconnected in a network can be converted into a graph and specific numeric labels assigned to the converted graph under certain rules help us in the regulation of data traffic, connectivity, and bandwidth as well as in coding/decoding of signals. Especially, both antimagic and magic graphs serve as models for surveillance or security systems in urban planning. In 1998, Enomoto et al. introduced the notion of super a,0 edge-antimagic labeling of graphs. In this article, we shall compute super a,0 edge-antimagic labeling of the rooted product of Pn and the complete bipartite graph K2,m combined with the union of path, copies of paths, and the star. We shall also compute a super a,0 edge-antimagic labeling of rooted product of Pn with a special type of pancyclic graphs. The labeling provided here will also serve as super a′,2 edge-antimagic labeling of the aforesaid graphs. All the structures discussed in this article are planar. Moreover, our findings have also been illustrated with examples and summarized in the form of a table and 3D plots. |
| doi_str_mv | 10.1155/2020/2160104 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2449949309</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2449949309</sourcerecordid><originalsourceid>FETCH-LOGICAL-c360t-821fac34427fa6e91d43d972bc323ad7b3e2bbc4763e44e213e7aa3ae6b9c7de3</originalsourceid><addsrcrecordid>eNqF0EFLw0AQBeBFFKzVm2cJeNTYnZ1N0j1KqVWoKKLoLWx2J2lK2427CeK_NyWCR08zMB9v4DF2DvwGIEkmggs-EZBy4PKAjSBJMU5AZof9zoWMQeDHMTsJYc25gASmIzafuW3TtfWuiua2ouid6mrVhsiV0aOuahMtdUGb_dntohfnWrLRs3e2MwNaeN2swik7KvUm0NnvHLO3u_nr7D5ePi0eZrfL2GDK23gqoNQGpRRZqVNSYCValYnCoEBtswJJFIWRWYokJQlAyrRGTWmhTGYJx-xyyG28--wotPnadX7Xv8yFlEpJhVz16npQxrsQPJV54-ut9t858HxfVL4vKv8tqudXA1_VO6u_6v_0xaCpN1TqPw0KM0D8AZVScG4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2449949309</pqid></control><display><type>article</type><title>Computing Edge Weights of Magic Labeling on Rooted Products of Graphs</title><source>Wiley-Blackwell Open Access Titles</source><source>EZB-FREE-00999 freely available EZB journals</source><source>Alma/SFX Local Collection</source><creator>Liu, Jia-Bao ; Javaid, Muhammad ; Afzal, Hafiz Usman</creator><contributor>Palmeri, Alessandro ; Alessandro Palmeri</contributor><creatorcontrib>Liu, Jia-Bao ; Javaid, Muhammad ; Afzal, Hafiz Usman ; Palmeri, Alessandro ; Alessandro Palmeri</creatorcontrib><description>Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications in the fields of civil, software, electrical, and network engineering. For example, in network engineering, any systems interconnected in a network can be converted into a graph and specific numeric labels assigned to the converted graph under certain rules help us in the regulation of data traffic, connectivity, and bandwidth as well as in coding/decoding of signals. Especially, both antimagic and magic graphs serve as models for surveillance or security systems in urban planning. In 1998, Enomoto et al. introduced the notion of super a,0 edge-antimagic labeling of graphs. In this article, we shall compute super a,0 edge-antimagic labeling of the rooted product of Pn and the complete bipartite graph K2,m combined with the union of path, copies of paths, and the star. We shall also compute a super a,0 edge-antimagic labeling of rooted product of Pn with a special type of pancyclic graphs. The labeling provided here will also serve as super a′,2 edge-antimagic labeling of the aforesaid graphs. All the structures discussed in this article are planar. Moreover, our findings have also been illustrated with examples and summarized in the form of a table and 3D plots.</description><identifier>ISSN: 1024-123X</identifier><identifier>EISSN: 1563-5147</identifier><identifier>DOI: 10.1155/2020/2160104</identifier><language>eng</language><publisher>Cairo, Egypt: Hindawi Publishing Corporation</publisher><subject>Civil engineering ; Construction ; Data mining ; Decoding ; Design ; Graph theory ; Graphs ; Labeling ; Labels ; Security systems ; Software engineering ; Surveillance ; Urban planning ; Wireless networks</subject><ispartof>Mathematical problems in engineering, 2020, Vol.2020 (2020), p.1-16</ispartof><rights>Copyright © 2020 Jia-Bao Liu et al.</rights><rights>Copyright © 2020 Jia-Bao Liu et al. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c360t-821fac34427fa6e91d43d972bc323ad7b3e2bbc4763e44e213e7aa3ae6b9c7de3</citedby><cites>FETCH-LOGICAL-c360t-821fac34427fa6e91d43d972bc323ad7b3e2bbc4763e44e213e7aa3ae6b9c7de3</cites><orcidid>0000-0001-7241-8172 ; 0000-0002-9620-7692</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,4022,27922,27923,27924</link.rule.ids></links><search><contributor>Palmeri, Alessandro</contributor><contributor>Alessandro Palmeri</contributor><creatorcontrib>Liu, Jia-Bao</creatorcontrib><creatorcontrib>Javaid, Muhammad</creatorcontrib><creatorcontrib>Afzal, Hafiz Usman</creatorcontrib><title>Computing Edge Weights of Magic Labeling on Rooted Products of Graphs</title><title>Mathematical problems in engineering</title><description>Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications in the fields of civil, software, electrical, and network engineering. For example, in network engineering, any systems interconnected in a network can be converted into a graph and specific numeric labels assigned to the converted graph under certain rules help us in the regulation of data traffic, connectivity, and bandwidth as well as in coding/decoding of signals. Especially, both antimagic and magic graphs serve as models for surveillance or security systems in urban planning. In 1998, Enomoto et al. introduced the notion of super a,0 edge-antimagic labeling of graphs. In this article, we shall compute super a,0 edge-antimagic labeling of the rooted product of Pn and the complete bipartite graph K2,m combined with the union of path, copies of paths, and the star. We shall also compute a super a,0 edge-antimagic labeling of rooted product of Pn with a special type of pancyclic graphs. The labeling provided here will also serve as super a′,2 edge-antimagic labeling of the aforesaid graphs. All the structures discussed in this article are planar. Moreover, our findings have also been illustrated with examples and summarized in the form of a table and 3D plots.</description><subject>Civil engineering</subject><subject>Construction</subject><subject>Data mining</subject><subject>Decoding</subject><subject>Design</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Labeling</subject><subject>Labels</subject><subject>Security systems</subject><subject>Software engineering</subject><subject>Surveillance</subject><subject>Urban planning</subject><subject>Wireless networks</subject><issn>1024-123X</issn><issn>1563-5147</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>RHX</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNqF0EFLw0AQBeBFFKzVm2cJeNTYnZ1N0j1KqVWoKKLoLWx2J2lK2427CeK_NyWCR08zMB9v4DF2DvwGIEkmggs-EZBy4PKAjSBJMU5AZof9zoWMQeDHMTsJYc25gASmIzafuW3TtfWuiua2ouid6mrVhsiV0aOuahMtdUGb_dntohfnWrLRs3e2MwNaeN2swik7KvUm0NnvHLO3u_nr7D5ePi0eZrfL2GDK23gqoNQGpRRZqVNSYCValYnCoEBtswJJFIWRWYokJQlAyrRGTWmhTGYJx-xyyG28--wotPnadX7Xv8yFlEpJhVz16npQxrsQPJV54-ut9t858HxfVL4vKv8tqudXA1_VO6u_6v_0xaCpN1TqPw0KM0D8AZVScG4</recordid><startdate>2020</startdate><enddate>2020</enddate><creator>Liu, Jia-Bao</creator><creator>Javaid, Muhammad</creator><creator>Afzal, Hafiz Usman</creator><general>Hindawi Publishing Corporation</general><general>Hindawi</general><general>Hindawi Limited</general><scope>ADJCN</scope><scope>AHFXO</scope><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CWDGH</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><orcidid>https://orcid.org/0000-0001-7241-8172</orcidid><orcidid>https://orcid.org/0000-0002-9620-7692</orcidid></search><sort><creationdate>2020</creationdate><title>Computing Edge Weights of Magic Labeling on Rooted Products of Graphs</title><author>Liu, Jia-Bao ; Javaid, Muhammad ; Afzal, Hafiz Usman</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c360t-821fac34427fa6e91d43d972bc323ad7b3e2bbc4763e44e213e7aa3ae6b9c7de3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Civil engineering</topic><topic>Construction</topic><topic>Data mining</topic><topic>Decoding</topic><topic>Design</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Labeling</topic><topic>Labels</topic><topic>Security systems</topic><topic>Software engineering</topic><topic>Surveillance</topic><topic>Urban planning</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liu, Jia-Bao</creatorcontrib><creatorcontrib>Javaid, Muhammad</creatorcontrib><creatorcontrib>Afzal, Hafiz Usman</creatorcontrib><collection>الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals</collection><collection>معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete</collection><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access Journals</collection><collection>CrossRef</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Middle East & Africa Database</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><jtitle>Mathematical problems in engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liu, Jia-Bao</au><au>Javaid, Muhammad</au><au>Afzal, Hafiz Usman</au><au>Palmeri, Alessandro</au><au>Alessandro Palmeri</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Computing Edge Weights of Magic Labeling on Rooted Products of Graphs</atitle><jtitle>Mathematical problems in engineering</jtitle><date>2020</date><risdate>2020</risdate><volume>2020</volume><issue>2020</issue><spage>1</spage><epage>16</epage><pages>1-16</pages><issn>1024-123X</issn><eissn>1563-5147</eissn><abstract>Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications in the fields of civil, software, electrical, and network engineering. For example, in network engineering, any systems interconnected in a network can be converted into a graph and specific numeric labels assigned to the converted graph under certain rules help us in the regulation of data traffic, connectivity, and bandwidth as well as in coding/decoding of signals. Especially, both antimagic and magic graphs serve as models for surveillance or security systems in urban planning. In 1998, Enomoto et al. introduced the notion of super a,0 edge-antimagic labeling of graphs. In this article, we shall compute super a,0 edge-antimagic labeling of the rooted product of Pn and the complete bipartite graph K2,m combined with the union of path, copies of paths, and the star. We shall also compute a super a,0 edge-antimagic labeling of rooted product of Pn with a special type of pancyclic graphs. The labeling provided here will also serve as super a′,2 edge-antimagic labeling of the aforesaid graphs. All the structures discussed in this article are planar. Moreover, our findings have also been illustrated with examples and summarized in the form of a table and 3D plots.</abstract><cop>Cairo, Egypt</cop><pub>Hindawi Publishing Corporation</pub><doi>10.1155/2020/2160104</doi><tpages>16</tpages><orcidid>https://orcid.org/0000-0001-7241-8172</orcidid><orcidid>https://orcid.org/0000-0002-9620-7692</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1024-123X |
| ispartof | Mathematical problems in engineering, 2020, Vol.2020 (2020), p.1-16 |
| issn | 1024-123X 1563-5147 |
| language | eng |
| recordid | cdi_proquest_journals_2449949309 |
| source | Wiley-Blackwell Open Access Titles; EZB-FREE-00999 freely available EZB journals; Alma/SFX Local Collection |
| subjects | Civil engineering Construction Data mining Decoding Design Graph theory Graphs Labeling Labels Security systems Software engineering Surveillance Urban planning Wireless networks |
| title | Computing Edge Weights of Magic Labeling on Rooted Products of Graphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T19%3A40%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Computing%20Edge%20Weights%20of%20Magic%20Labeling%20on%20Rooted%20Products%20of%20Graphs&rft.jtitle=Mathematical%20problems%20in%20engineering&rft.au=Liu,%20Jia-Bao&rft.date=2020&rft.volume=2020&rft.issue=2020&rft.spage=1&rft.epage=16&rft.pages=1-16&rft.issn=1024-123X&rft.eissn=1563-5147&rft_id=info:doi/10.1155/2020/2160104&rft_dat=%3Cproquest_cross%3E2449949309%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2449949309&rft_id=info:pmid/&rfr_iscdi=true |