Edge-Magic Total Labellings of some Network Models

Edge-Magic Total Labellings of some Network Models

It has been known that edge-symmetric graphs can be used as models of some scale-free networks, such as hierarchial networks and self-similar networks, such as graph colorings can be used for distinguishing objects of communication and informa-tion networks. We study the edge-magic property of edge-...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied Mechanics and Materials 2013-08, Vol.347-350, p.2752-2757
Hauptverfasser: Wang, Hong Yu, Yao, Ming, Yang, Chao, Zhao, Zhen Xue, Chen, Xiang En, Yao, Bing, Yang, Si Hua
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 2757
container_issue
container_start_page 2752
container_title Applied Mechanics and Materials
container_volume 347-350
creator Wang, Hong Yu
Yao, Ming
Yang, Chao
Zhao, Zhen Xue
Chen, Xiang En
Yao, Bing
Yang, Si Hua
description It has been known that edge-symmetric graphs can be used as models of some scale-free networks, such as hierarchial networks and self-similar networks, such as graph colorings can be used for distinguishing objects of communication and informa-tion networks. We study the edge-magic property of edge-symmetric graphs, and construct graphs having edge-magic total labellings from smaller graphs.
doi_str_mv 10.4028/www.scientific.net/AMM.347-350.2752
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1442326613</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3100594451</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2862-82f9508ab2165554cceaccfbd53809e6340973481eb239283ed23a423c7ad78a3</originalsourceid><addsrcrecordid>eNqV0MtOwzAQBVCLh0Rb-IdILFFSv-0sq6o8pAY2ZW05jlNS0rjYqSL-HpcgwZbVLObqzugAcIdgRiGW82EYsmAa2_VN3Ziss_18URQZoSIlDGZYMHwGJohznAoq8TmYEkiEZEJSfvG9gGlOCL8C0xB2EHKKqJwAvKq2Ni30tjHJxvW6Tda6tG3bdNuQuDoJbm-TZ9sPzr8nhatsG67BZa3bYG9-5gy83q82y8d0_fLwtFysU4Nl_ELiOmdQ6hIjzhijxlhtTF1WjEiYW04ozAWhEtkSkxxLYitMNMXECF0JqckM3I69B-8-jjb0aueOvosnFaIxhzlHJKaWY8p4F4K3tTr4Zq_9p0JQneRUlFO_cirKqSinopyKcuokF1tWY0vvdRd6a97-HPtHzxdo630p</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1442326613</pqid></control><display><type>article</type><title>Edge-Magic Total Labellings of some Network Models</title><source>Scientific.net Journals</source><creator>Wang, Hong Yu ; Yao, Ming ; Yang, Chao ; Zhao, Zhen Xue ; Chen, Xiang En ; Yao, Bing ; Yang, Si Hua</creator><creatorcontrib>Wang, Hong Yu ; Yao, Ming ; Yang, Chao ; Zhao, Zhen Xue ; Chen, Xiang En ; Yao, Bing ; Yang, Si Hua</creatorcontrib><description>It has been known that edge-symmetric graphs can be used as models of some scale-free networks, such as hierarchial networks and self-similar networks, such as graph colorings can be used for distinguishing objects of communication and informa-tion networks. We study the edge-magic property of edge-symmetric graphs, and construct graphs having edge-magic total labellings from smaller graphs.</description><identifier>ISSN: 1660-9336</identifier><identifier>ISSN: 1662-7482</identifier><identifier>ISBN: 3037857846</identifier><identifier>ISBN: 9783037857847</identifier><identifier>EISSN: 1662-7482</identifier><identifier>DOI: 10.4028/www.scientific.net/AMM.347-350.2752</identifier><language>eng</language><publisher>Zurich: Trans Tech Publications Ltd</publisher><ispartof>Applied Mechanics and Materials, 2013-08, Vol.347-350, p.2752-2757</ispartof><rights>2013 Trans Tech Publications Ltd</rights><rights>Copyright Trans Tech Publications Ltd. Aug 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2862-82f9508ab2165554cceaccfbd53809e6340973481eb239283ed23a423c7ad78a3</citedby><cites>FETCH-LOGICAL-c2862-82f9508ab2165554cceaccfbd53809e6340973481eb239283ed23a423c7ad78a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://www.scientific.net/Image/TitleCover/2560?width=600</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><creatorcontrib>Wang, Hong Yu</creatorcontrib><creatorcontrib>Yao, Ming</creatorcontrib><creatorcontrib>Yang, Chao</creatorcontrib><creatorcontrib>Zhao, Zhen Xue</creatorcontrib><creatorcontrib>Chen, Xiang En</creatorcontrib><creatorcontrib>Yao, Bing</creatorcontrib><creatorcontrib>Yang, Si Hua</creatorcontrib><title>Edge-Magic Total Labellings of some Network Models</title><title>Applied Mechanics and Materials</title><description>It has been known that edge-symmetric graphs can be used as models of some scale-free networks, such as hierarchial networks and self-similar networks, such as graph colorings can be used for distinguishing objects of communication and informa-tion networks. We study the edge-magic property of edge-symmetric graphs, and construct graphs having edge-magic total labellings from smaller graphs.</description><issn>1660-9336</issn><issn>1662-7482</issn><issn>1662-7482</issn><isbn>3037857846</isbn><isbn>9783037857847</isbn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqV0MtOwzAQBVCLh0Rb-IdILFFSv-0sq6o8pAY2ZW05jlNS0rjYqSL-HpcgwZbVLObqzugAcIdgRiGW82EYsmAa2_VN3Ziss_18URQZoSIlDGZYMHwGJohznAoq8TmYEkiEZEJSfvG9gGlOCL8C0xB2EHKKqJwAvKq2Ni30tjHJxvW6Tda6tG3bdNuQuDoJbm-TZ9sPzr8nhatsG67BZa3bYG9-5gy83q82y8d0_fLwtFysU4Nl_ELiOmdQ6hIjzhijxlhtTF1WjEiYW04ozAWhEtkSkxxLYitMNMXECF0JqckM3I69B-8-jjb0aueOvosnFaIxhzlHJKaWY8p4F4K3tTr4Zq_9p0JQneRUlFO_cirKqSinopyKcuokF1tWY0vvdRd6a97-HPtHzxdo630p</recordid><startdate>20130801</startdate><enddate>20130801</enddate><creator>Wang, Hong Yu</creator><creator>Yao, Ming</creator><creator>Yang, Chao</creator><creator>Zhao, Zhen Xue</creator><creator>Chen, Xiang En</creator><creator>Yao, Bing</creator><creator>Yang, Si Hua</creator><general>Trans Tech Publications Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SR</scope><scope>7TB</scope><scope>8BQ</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>BENPR</scope><scope>BFMQW</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>KB.</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>PDBOC</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20130801</creationdate><title>Edge-Magic Total Labellings of some Network Models</title><author>Wang, Hong Yu ; Yao, Ming ; Yang, Chao ; Zhao, Zhen Xue ; Chen, Xiang En ; Yao, Bing ; Yang, Si Hua</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2862-82f9508ab2165554cceaccfbd53809e6340973481eb239283ed23a423c7ad78a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Hong Yu</creatorcontrib><creatorcontrib>Yao, Ming</creatorcontrib><creatorcontrib>Yang, Chao</creatorcontrib><creatorcontrib>Zhao, Zhen Xue</creatorcontrib><creatorcontrib>Chen, Xiang En</creatorcontrib><creatorcontrib>Yao, Bing</creatorcontrib><creatorcontrib>Yang, Si Hua</creatorcontrib><collection>CrossRef</collection><collection>Engineered Materials Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central</collection><collection>Continental Europe Database</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>Materials Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Materials Science Collection</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>Applied Mechanics and Materials</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Hong Yu</au><au>Yao, Ming</au><au>Yang, Chao</au><au>Zhao, Zhen Xue</au><au>Chen, Xiang En</au><au>Yao, Bing</au><au>Yang, Si Hua</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Edge-Magic Total Labellings of some Network Models</atitle><jtitle>Applied Mechanics and Materials</jtitle><date>2013-08-01</date><risdate>2013</risdate><volume>347-350</volume><spage>2752</spage><epage>2757</epage><pages>2752-2757</pages><issn>1660-9336</issn><issn>1662-7482</issn><eissn>1662-7482</eissn><isbn>3037857846</isbn><isbn>9783037857847</isbn><abstract>It has been known that edge-symmetric graphs can be used as models of some scale-free networks, such as hierarchial networks and self-similar networks, such as graph colorings can be used for distinguishing objects of communication and informa-tion networks. We study the edge-magic property of edge-symmetric graphs, and construct graphs having edge-magic total labellings from smaller graphs.</abstract><cop>Zurich</cop><pub>Trans Tech Publications Ltd</pub><doi>10.4028/www.scientific.net/AMM.347-350.2752</doi><tpages>6</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1660-9336
ispartof Applied Mechanics and Materials, 2013-08, Vol.347-350, p.2752-2757
issn 1660-9336
1662-7482
1662-7482
language eng
recordid cdi_proquest_journals_1442326613
source Scientific.net Journals
title Edge-Magic Total Labellings of some Network Models
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T21%3A13%3A59IST&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=Edge-Magic%20Total%20Labellings%20of%20some%20Network%20Models&rft.jtitle=Applied%20Mechanics%20and%20Materials&rft.au=Wang,%20Hong%20Yu&rft.date=2013-08-01&rft.volume=347-350&rft.spage=2752&rft.epage=2757&rft.pages=2752-2757&rft.issn=1660-9336&rft.eissn=1662-7482&rft.isbn=3037857846&rft.isbn_list=9783037857847&rft_id=info:doi/10.4028/www.scientific.net/AMM.347-350.2752&rft_dat=%3Cproquest_cross%3E3100594451%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=1442326613&rft_id=info:pmid/&rfr_iscdi=true