A Novel Approach for Cyclic Decompositions of Balanced Complete Bipartite Graphs into Infinite Graph Classes

Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences. Graph labelings and decompositions have received much attention in the literature. Several...

Full description

Saved in:
Bibliographic Details
Published in:Journal of function spaces 2022-01, Vol.2022, p.1-12
Main Authors: El-Mesady, A., Bazighifan, Omar, Askar, S. S.
Format: Article
Language:English
Subjects:
Apexes
Codes
Decomposition
Graph theory
Graphs
Labeling
Trees (mathematics)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c2488-1e1eaaa57c1ed0ea573dbbbd6935a46e0f00cfa08771f00274b0e2d333031ffa3
cites cdi_FETCH-LOGICAL-c2488-1e1eaaa57c1ed0ea573dbbbd6935a46e0f00cfa08771f00274b0e2d333031ffa3
container_end_page 12
container_issue
container_start_page 1
container_title Journal of function spaces
container_volume 2022
creator El-Mesady, A.
Bazighifan, Omar
Askar, S. S.
description Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences. Graph labelings and decompositions have received much attention in the literature. Several types of graph labeling were proposed for solving the problem of decomposing different graph classes. In the present paper, we propose a technique for labeling the vertices of a bipartite graph G with n edges, called orthogonal labeling, to yield cyclic decompositions of balanced complete bipartite graphs Kn,n by the graph G. By applying the proposed orthogonal labeling technique, we had constructed decompositions of Kn,n by paths, trees, one factorization, disjoint union of cycles, complete bipartite graphs, disjoint union of trees, caterpillars, and so forth. From the constructed results, we can confirm that the proposed orthogonal labeling technique is effective.
doi_str_mv 10.1155/2022/9308708
format article
fullrecord <record><control><sourceid>proquest_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_c402ba8e04224ed18619817465ef2e0d</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_c402ba8e04224ed18619817465ef2e0d</doaj_id><sourcerecordid>2664615607</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2488-1e1eaaa57c1ed0ea573dbbbd6935a46e0f00cfa08771f00274b0e2d333031ffa3</originalsourceid><addsrcrecordid>eNp9kU9P3DAQxaOKSkXArR_AUo90y_hPnOS4BEpXQvTSnq2JPe56FeJghyK-fb1dtEd88dP4pzczflX1mcM3zuv6SoAQV52EtoH2Q3UqJFertpyTo-70p-oi5x0AcN5xVden1bhmD_EvjWw9zymi3TIfE-tf7RgsuyEbH-eYwxLilFn07BpHnCw51peHkRZi12HGtISi7hLO28zCtES2mXyYjkXWj5gz5fPqo8cx08XbfVb9_n77q_-xuv95t-nX9ysrVNuuOHFCxLqxnBxQEdINw-B0J2tUmsADWI9l04YXKRo1AAknpQTJvUd5Vm0Ovi7izswpPGJ6NRGD-V-I6Y_Zz2xHMlaBGLAlUEIocrzVvGt5o3RNXhC44vXl4FW-5-mZ8mJ28TlNZXwjtFaa1xqaQn09UDbFnBP5Y1cOZh-P2cdj3uIp-OUB34bJ4Ut4n_4HjR2N9w</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2664615607</pqid></control><display><type>article</type><title>A Novel Approach for Cyclic Decompositions of Balanced Complete Bipartite Graphs into Infinite Graph Classes</title><source>Wiley-Blackwell Open Access Collection</source><source>Publicly Available Content Database</source><creator>El-Mesady, A. ; Bazighifan, Omar ; Askar, S. S.</creator><contributor>Matucci, Serena ; Serena Matucci</contributor><creatorcontrib>El-Mesady, A. ; Bazighifan, Omar ; Askar, S. S. ; Matucci, Serena ; Serena Matucci</creatorcontrib><description>Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences. Graph labelings and decompositions have received much attention in the literature. Several types of graph labeling were proposed for solving the problem of decomposing different graph classes. In the present paper, we propose a technique for labeling the vertices of a bipartite graph G with n edges, called orthogonal labeling, to yield cyclic decompositions of balanced complete bipartite graphs Kn,n by the graph G. By applying the proposed orthogonal labeling technique, we had constructed decompositions of Kn,n by paths, trees, one factorization, disjoint union of cycles, complete bipartite graphs, disjoint union of trees, caterpillars, and so forth. From the constructed results, we can confirm that the proposed orthogonal labeling technique is effective.</description><identifier>ISSN: 2314-8896</identifier><identifier>EISSN: 2314-8888</identifier><identifier>DOI: 10.1155/2022/9308708</identifier><language>eng</language><publisher>New York: Hindawi</publisher><subject>Apexes ; Codes ; Decomposition ; Graph theory ; Graphs ; Labeling ; Trees (mathematics)</subject><ispartof>Journal of function spaces, 2022-01, Vol.2022, p.1-12</ispartof><rights>Copyright © 2022 A. El-Mesady et al.</rights><rights>Copyright © 2022 A. El-Mesady 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-c2488-1e1eaaa57c1ed0ea573dbbbd6935a46e0f00cfa08771f00274b0e2d333031ffa3</citedby><cites>FETCH-LOGICAL-c2488-1e1eaaa57c1ed0ea573dbbbd6935a46e0f00cfa08771f00274b0e2d333031ffa3</cites><orcidid>0000-0003-2009-3905 ; 0000-0002-1167-2430 ; 0000-0002-7251-9608</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/2664615607/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2664615607?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,777,781,25734,27905,27906,36993,44571,74875</link.rule.ids></links><search><contributor>Matucci, Serena</contributor><contributor>Serena Matucci</contributor><creatorcontrib>El-Mesady, A.</creatorcontrib><creatorcontrib>Bazighifan, Omar</creatorcontrib><creatorcontrib>Askar, S. S.</creatorcontrib><title>A Novel Approach for Cyclic Decompositions of Balanced Complete Bipartite Graphs into Infinite Graph Classes</title><title>Journal of function spaces</title><description>Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences. Graph labelings and decompositions have received much attention in the literature. Several types of graph labeling were proposed for solving the problem of decomposing different graph classes. In the present paper, we propose a technique for labeling the vertices of a bipartite graph G with n edges, called orthogonal labeling, to yield cyclic decompositions of balanced complete bipartite graphs Kn,n by the graph G. By applying the proposed orthogonal labeling technique, we had constructed decompositions of Kn,n by paths, trees, one factorization, disjoint union of cycles, complete bipartite graphs, disjoint union of trees, caterpillars, and so forth. From the constructed results, we can confirm that the proposed orthogonal labeling technique is effective.</description><subject>Apexes</subject><subject>Codes</subject><subject>Decomposition</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Labeling</subject><subject>Trees (mathematics)</subject><issn>2314-8896</issn><issn>2314-8888</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><sourceid>DOA</sourceid><recordid>eNp9kU9P3DAQxaOKSkXArR_AUo90y_hPnOS4BEpXQvTSnq2JPe56FeJghyK-fb1dtEd88dP4pzczflX1mcM3zuv6SoAQV52EtoH2Q3UqJFertpyTo-70p-oi5x0AcN5xVden1bhmD_EvjWw9zymi3TIfE-tf7RgsuyEbH-eYwxLilFn07BpHnCw51peHkRZi12HGtISi7hLO28zCtES2mXyYjkXWj5gz5fPqo8cx08XbfVb9_n77q_-xuv95t-nX9ysrVNuuOHFCxLqxnBxQEdINw-B0J2tUmsADWI9l04YXKRo1AAknpQTJvUd5Vm0Ovi7izswpPGJ6NRGD-V-I6Y_Zz2xHMlaBGLAlUEIocrzVvGt5o3RNXhC44vXl4FW-5-mZ8mJ28TlNZXwjtFaa1xqaQn09UDbFnBP5Y1cOZh-P2cdj3uIp-OUB34bJ4Ut4n_4HjR2N9w</recordid><startdate>20220101</startdate><enddate>20220101</enddate><creator>El-Mesady, A.</creator><creator>Bazighifan, Omar</creator><creator>Askar, S. S.</creator><general>Hindawi</general><general>Hindawi Limited</general><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7TB</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>CCPQU</scope><scope>CWDGH</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>H8D</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M7S</scope><scope>P62</scope><scope>PATMY</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>Q9U</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0003-2009-3905</orcidid><orcidid>https://orcid.org/0000-0002-1167-2430</orcidid><orcidid>https://orcid.org/0000-0002-7251-9608</orcidid></search><sort><creationdate>20220101</creationdate><title>A Novel Approach for Cyclic Decompositions of Balanced Complete Bipartite Graphs into Infinite Graph Classes</title><author>El-Mesady, A. ; Bazighifan, Omar ; Askar, S. S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2488-1e1eaaa57c1ed0ea573dbbbd6935a46e0f00cfa08771f00274b0e2d333031ffa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Apexes</topic><topic>Codes</topic><topic>Decomposition</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Labeling</topic><topic>Trees (mathematics)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>El-Mesady, A.</creatorcontrib><creatorcontrib>Bazighifan, Omar</creatorcontrib><creatorcontrib>Askar, S. S.</creatorcontrib><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access Journals</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>Agricultural &amp; Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Middle East &amp; Africa Database</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>Aerospace Database</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>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Engineering Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Environmental Science Database</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><collection>Environmental Science Collection</collection><collection>ProQuest Central Basic</collection><collection>Directory of Open Access Journals</collection><jtitle>Journal of function spaces</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>El-Mesady, A.</au><au>Bazighifan, Omar</au><au>Askar, S. S.</au><au>Matucci, Serena</au><au>Serena Matucci</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Novel Approach for Cyclic Decompositions of Balanced Complete Bipartite Graphs into Infinite Graph Classes</atitle><jtitle>Journal of function spaces</jtitle><date>2022-01-01</date><risdate>2022</risdate><volume>2022</volume><spage>1</spage><epage>12</epage><pages>1-12</pages><issn>2314-8896</issn><eissn>2314-8888</eissn><abstract>Graph theory is considered an attractive field for finding the proof techniques in discrete mathematics. The results of graph theory have applications in many areas of social, computing, and natural sciences. Graph labelings and decompositions have received much attention in the literature. Several types of graph labeling were proposed for solving the problem of decomposing different graph classes. In the present paper, we propose a technique for labeling the vertices of a bipartite graph G with n edges, called orthogonal labeling, to yield cyclic decompositions of balanced complete bipartite graphs Kn,n by the graph G. By applying the proposed orthogonal labeling technique, we had constructed decompositions of Kn,n by paths, trees, one factorization, disjoint union of cycles, complete bipartite graphs, disjoint union of trees, caterpillars, and so forth. From the constructed results, we can confirm that the proposed orthogonal labeling technique is effective.</abstract><cop>New York</cop><pub>Hindawi</pub><doi>10.1155/2022/9308708</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0003-2009-3905</orcidid><orcidid>https://orcid.org/0000-0002-1167-2430</orcidid><orcidid>https://orcid.org/0000-0002-7251-9608</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2314-8896
ispartof Journal of function spaces, 2022-01, Vol.2022, p.1-12
issn 2314-8896
2314-8888
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_c402ba8e04224ed18619817465ef2e0d
source Wiley-Blackwell Open Access Collection; Publicly Available Content Database
subjects Apexes
Codes
Decomposition
Graph theory
Graphs
Labeling
Trees (mathematics)
title A Novel Approach for Cyclic Decompositions of Balanced Complete Bipartite Graphs into Infinite Graph Classes
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T15%3A22%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Novel%20Approach%20for%20Cyclic%20Decompositions%20of%20Balanced%20Complete%20Bipartite%20Graphs%20into%20Infinite%20Graph%20Classes&rft.jtitle=Journal%20of%20function%20spaces&rft.au=El-Mesady,%20A.&rft.date=2022-01-01&rft.volume=2022&rft.spage=1&rft.epage=12&rft.pages=1-12&rft.issn=2314-8896&rft.eissn=2314-8888&rft_id=info:doi/10.1155/2022/9308708&rft_dat=%3Cproquest_doaj_%3E2664615607%3C/proquest_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c2488-1e1eaaa57c1ed0ea573dbbbd6935a46e0f00cfa08771f00274b0e2d333031ffa3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2664615607&rft_id=info:pmid/&rfr_iscdi=true