On the Edge-balanced Index Set of a class of Power-cycle Nested Network Graph

On the Edge-balanced Index Set of a class of Power-cycle Nested Network Graph

Based on the research of Power-cycle Nested Graph C6mxpm6, the decomposition method of single point sector has come up. By the use of the process of clawed nested-cycle sub-graph, the edge-balanced index sets of the power-cycle nested graph C6mxpm6 are solved when m ≥4 and m=4(mod5) . Besides, the c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of modern education and computer science 2013-10, Vol.5 (10), p.26-31
Hauptverfasser: Zhang, Qingwen, Zheng, Yuge
Format: Artikel
Sprache:eng
Schlagworte:
Computer science
Graphs
Labeling
Networks
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 31
container_issue 10
container_start_page 26
container_title International journal of modern education and computer science
container_volume 5
creator Zhang, Qingwen
Zheng, Yuge
description Based on the research of Power-cycle Nested Graph C6mxpm6, the decomposition method of single point sector has come up. By the use of the process of clawed nested-cycle sub-graph, the edge-balanced index sets of the power-cycle nested graph C6mxpm6 are solved when m ≥4 and m=4(mod5) . Besides, the constructive proofs of the computational formulas are also completed. The theory can be applied to information engineering, communication networks, computer science, economic management, medicine, etc. The proving method can be a reference to solve the problem of the power-cycle nested graph C6mxpm6.
doi_str_mv 10.5815/ijmecs.2013.09.04
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1627736234</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3506679411</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1134-5dadc9d8808e96b6c799d6f156a3cb2b499d728c28885548f1b2b19a12ddcd503</originalsourceid><addsrcrecordid>eNo9kEFLAzEQhYMoWGp_gLeA510zySabHKXUWqitoIK3kE2ytnW7W5Mttf_elIpzmTfDx7zhIXQLJOcS-P16s_U25pQAy4nKSXGBBpSUPCNQflz-awHXaBTjhqQSqqBEDdDzssX9yuOJ-_RZZRrTWu_wrHX-B7_6Hnc1Ntg2JsaTfOkOPmT2aBuPFz72CV34_tCFLzwNZre6QVe1aaIf_fUhen-cvI2fsvlyOhs_zDMLwIqMO-OsclIS6ZWohC2VcqIGLgyzFa2KNJZUWiql5LyQNaQlKAPUOes4YUN0d767C933Pj2iN90-tMlSg6BlyQRlRaLgTNnQxRh8rXdhvTXhqIHoU3D6HJw-BaeJ0qRgv1dOYF4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1627736234</pqid></control><display><type>article</type><title>On the Edge-balanced Index Set of a class of Power-cycle Nested Network Graph</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Zhang, Qingwen ; Zheng, Yuge</creator><creatorcontrib>Zhang, Qingwen ; Zheng, Yuge</creatorcontrib><description>Based on the research of Power-cycle Nested Graph C6mxpm6, the decomposition method of single point sector has come up. By the use of the process of clawed nested-cycle sub-graph, the edge-balanced index sets of the power-cycle nested graph C6mxpm6 are solved when m ≥4 and m=4(mod5) . Besides, the constructive proofs of the computational formulas are also completed. The theory can be applied to information engineering, communication networks, computer science, economic management, medicine, etc. The proving method can be a reference to solve the problem of the power-cycle nested graph C6mxpm6.</description><identifier>ISSN: 2075-0161</identifier><identifier>EISSN: 2075-017X</identifier><identifier>DOI: 10.5815/ijmecs.2013.09.04</identifier><language>eng</language><publisher>Hong Kong: Modern Education and Computer Science Press</publisher><subject>Computer science ; Graphs ; Labeling ; Networks</subject><ispartof>International journal of modern education and computer science, 2013-10, Vol.5 (10), p.26-31</ispartof><rights>Copyright Modern Education and Computer Science Press Oct 2013</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Zhang, Qingwen</creatorcontrib><creatorcontrib>Zheng, Yuge</creatorcontrib><title>On the Edge-balanced Index Set of a class of Power-cycle Nested Network Graph</title><title>International journal of modern education and computer science</title><description>Based on the research of Power-cycle Nested Graph C6mxpm6, the decomposition method of single point sector has come up. By the use of the process of clawed nested-cycle sub-graph, the edge-balanced index sets of the power-cycle nested graph C6mxpm6 are solved when m ≥4 and m=4(mod5) . Besides, the constructive proofs of the computational formulas are also completed. The theory can be applied to information engineering, communication networks, computer science, economic management, medicine, etc. The proving method can be a reference to solve the problem of the power-cycle nested graph C6mxpm6.</description><subject>Computer science</subject><subject>Graphs</subject><subject>Labeling</subject><subject>Networks</subject><issn>2075-0161</issn><issn>2075-017X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNo9kEFLAzEQhYMoWGp_gLeA510zySabHKXUWqitoIK3kE2ytnW7W5Mttf_elIpzmTfDx7zhIXQLJOcS-P16s_U25pQAy4nKSXGBBpSUPCNQflz-awHXaBTjhqQSqqBEDdDzssX9yuOJ-_RZZRrTWu_wrHX-B7_6Hnc1Ntg2JsaTfOkOPmT2aBuPFz72CV34_tCFLzwNZre6QVe1aaIf_fUhen-cvI2fsvlyOhs_zDMLwIqMO-OsclIS6ZWohC2VcqIGLgyzFa2KNJZUWiql5LyQNaQlKAPUOes4YUN0d767C933Pj2iN90-tMlSg6BlyQRlRaLgTNnQxRh8rXdhvTXhqIHoU3D6HJw-BaeJ0qRgv1dOYF4</recordid><startdate>20131026</startdate><enddate>20131026</enddate><creator>Zhang, Qingwen</creator><creator>Zheng, Yuge</creator><general>Modern Education and Computer Science Press</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0-V</scope><scope>3V.</scope><scope>7XB</scope><scope>88B</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ALSLI</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BVBZV</scope><scope>CCPQU</scope><scope>CJNVE</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>M0N</scope><scope>M0P</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEDU</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20131026</creationdate><title>On the Edge-balanced Index Set of a class of Power-cycle Nested Network Graph</title><author>Zhang, Qingwen ; Zheng, Yuge</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1134-5dadc9d8808e96b6c799d6f156a3cb2b499d728c28885548f1b2b19a12ddcd503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computer science</topic><topic>Graphs</topic><topic>Labeling</topic><topic>Networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Qingwen</creatorcontrib><creatorcontrib>Zheng, Yuge</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Social Sciences Premium Collection</collection><collection>ProQuest Central (Corporate)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Education Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Social Science Premium Collection</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection (ProQuest)</collection><collection>East &amp; South Asia Database</collection><collection>ProQuest One Community College</collection><collection>Education Collection</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Computing Database</collection><collection>ProQuest Education Journals</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Education</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>ProQuest Central Basic</collection><jtitle>International journal of modern education and computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhang, Qingwen</au><au>Zheng, Yuge</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Edge-balanced Index Set of a class of Power-cycle Nested Network Graph</atitle><jtitle>International journal of modern education and computer science</jtitle><date>2013-10-26</date><risdate>2013</risdate><volume>5</volume><issue>10</issue><spage>26</spage><epage>31</epage><pages>26-31</pages><issn>2075-0161</issn><eissn>2075-017X</eissn><abstract>Based on the research of Power-cycle Nested Graph C6mxpm6, the decomposition method of single point sector has come up. By the use of the process of clawed nested-cycle sub-graph, the edge-balanced index sets of the power-cycle nested graph C6mxpm6 are solved when m ≥4 and m=4(mod5) . Besides, the constructive proofs of the computational formulas are also completed. The theory can be applied to information engineering, communication networks, computer science, economic management, medicine, etc. The proving method can be a reference to solve the problem of the power-cycle nested graph C6mxpm6.</abstract><cop>Hong Kong</cop><pub>Modern Education and Computer Science Press</pub><doi>10.5815/ijmecs.2013.09.04</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2075-0161
ispartof International journal of modern education and computer science, 2013-10, Vol.5 (10), p.26-31
issn 2075-0161
2075-017X
language eng
recordid cdi_proquest_journals_1627736234
source EZB-FREE-00999 freely available EZB journals
subjects Computer science
Graphs
Labeling
Networks
title On the Edge-balanced Index Set of a class of Power-cycle Nested Network Graph
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T02%3A26%3A17IST&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=On%20the%20Edge-balanced%20Index%20Set%20of%20a%20class%20of%20Power-cycle%20Nested%20Network%20Graph&rft.jtitle=International%20journal%20of%20modern%20education%20and%20computer%20science&rft.au=Zhang,%20Qingwen&rft.date=2013-10-26&rft.volume=5&rft.issue=10&rft.spage=26&rft.epage=31&rft.pages=26-31&rft.issn=2075-0161&rft.eissn=2075-017X&rft_id=info:doi/10.5815/ijmecs.2013.09.04&rft_dat=%3Cproquest_cross%3E3506679411%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=1627736234&rft_id=info:pmid/&rfr_iscdi=true