Product Binary L-Cordial Labeling of Various Degree Splitting Graphs
This study examines the probability of the degree splitting operation results from various graphs being product binary L-cordial Graphs. The graphs under investigation include the Path graph (Pn), Comb graph (Pn ⊙ k1), Double comb graph (Pn ⊙ 2k1), Cycle graph (Cn), Shell graph (Sn) and Ladder graph...
Gespeichert in:
| Veröffentlicht in: | Communications in Mathematics and Applications 2024-01, Vol.15 (1), p.417-429 |
|---|---|
| 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 | 429 |
|---|---|
| container_issue | 1 |
| container_start_page | 417 |
| container_title | Communications in Mathematics and Applications |
| container_volume | 15 |
| creator | Prajapati, U. M. Patel, P. A. |
| description | This study examines the probability of the degree splitting operation results from various graphs being product binary L-cordial Graphs. The graphs under investigation include the Path graph (Pn), Comb graph (Pn ⊙ k1), Double comb graph (Pn ⊙ 2k1), Cycle graph (Cn), Shell graph (Sn) and Ladder graph (Ln). The application of product binary L-cordial labeling demonstrates that these analyzed graphs exhibit characteristics of product binary L-cordial graphs. |
| doi_str_mv | 10.26713/cma.v15i1.2541 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3049155824</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3049155824</sourcerecordid><originalsourceid>FETCH-LOGICAL-c153t-1d10bfb0f712f04080187e44fa4ac61467c73c3fa67b570087d4826a0492da273</originalsourceid><addsrcrecordid>eNotkE1Lw0AQhhdRsNSevS54Tjv7nRy11SoEFPy4Lptkt25Ju3E3Efz3TVtPMzAP8_I-CN0SmFOpCFvUOzP_JcKTORWcXKAJFEpkuQR1edplJgoQ12iW0hYAaCG5YsUErd5iaIa6xw9-b-IfLrNliI03LS5NZVu_3-Dg8JeJPgwJr-wmWovfu9b3_fG2jqb7Tjfoypk22dn_nKLPp8eP5XNWvq5flvdlVhPB-ow0BCpXgVOEOuCQA8mV5dwZbmpJuFS1YjVzRqpKKIBcNTyn0gAvaGOoYlN0d_7bxfAz2NTrbRjifozUbISIEDnlI7U4U3UMKUXrdBf9biynCeiTLT3a0idb-miLHQCIs1v3</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3049155824</pqid></control><display><type>article</type><title>Product Binary L-Cordial Labeling of Various Degree Splitting Graphs</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Prajapati, U. M. ; Patel, P. A.</creator><creatorcontrib>Prajapati, U. M. ; Patel, P. A.</creatorcontrib><description>This study examines the probability of the degree splitting operation results from various graphs being product binary L-cordial Graphs. The graphs under investigation include the Path graph (Pn), Comb graph (Pn ⊙ k1), Double comb graph (Pn ⊙ 2k1), Cycle graph (Cn), Shell graph (Sn) and Ladder graph (Ln). The application of product binary L-cordial labeling demonstrates that these analyzed graphs exhibit characteristics of product binary L-cordial graphs.</description><identifier>ISSN: 0976-5905</identifier><identifier>EISSN: 0975-8607</identifier><identifier>DOI: 10.26713/cma.v15i1.2541</identifier><language>eng</language><publisher>Kingsville: RGN Publications</publisher><subject>Graphs ; Labeling ; Splitting</subject><ispartof>Communications in Mathematics and Applications, 2024-01, Vol.15 (1), p.417-429</ispartof><rights>2024. This work is published under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0002-5362-7662 ; 0000-0002-4594-0122</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,778,782,27907,27908</link.rule.ids></links><search><creatorcontrib>Prajapati, U. M.</creatorcontrib><creatorcontrib>Patel, P. A.</creatorcontrib><title>Product Binary L-Cordial Labeling of Various Degree Splitting Graphs</title><title>Communications in Mathematics and Applications</title><description>This study examines the probability of the degree splitting operation results from various graphs being product binary L-cordial Graphs. The graphs under investigation include the Path graph (Pn), Comb graph (Pn ⊙ k1), Double comb graph (Pn ⊙ 2k1), Cycle graph (Cn), Shell graph (Sn) and Ladder graph (Ln). The application of product binary L-cordial labeling demonstrates that these analyzed graphs exhibit characteristics of product binary L-cordial graphs.</description><subject>Graphs</subject><subject>Labeling</subject><subject>Splitting</subject><issn>0976-5905</issn><issn>0975-8607</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNotkE1Lw0AQhhdRsNSevS54Tjv7nRy11SoEFPy4Lptkt25Ju3E3Efz3TVtPMzAP8_I-CN0SmFOpCFvUOzP_JcKTORWcXKAJFEpkuQR1edplJgoQ12iW0hYAaCG5YsUErd5iaIa6xw9-b-IfLrNliI03LS5NZVu_3-Dg8JeJPgwJr-wmWovfu9b3_fG2jqb7Tjfoypk22dn_nKLPp8eP5XNWvq5flvdlVhPB-ow0BCpXgVOEOuCQA8mV5dwZbmpJuFS1YjVzRqpKKIBcNTyn0gAvaGOoYlN0d_7bxfAz2NTrbRjifozUbISIEDnlI7U4U3UMKUXrdBf9biynCeiTLT3a0idb-miLHQCIs1v3</recordid><startdate>20240101</startdate><enddate>20240101</enddate><creator>Prajapati, U. M.</creator><creator>Patel, P. A.</creator><general>RGN Publications</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope><orcidid>https://orcid.org/0000-0002-5362-7662</orcidid><orcidid>https://orcid.org/0000-0002-4594-0122</orcidid></search><sort><creationdate>20240101</creationdate><title>Product Binary L-Cordial Labeling of Various Degree Splitting Graphs</title><author>Prajapati, U. M. ; Patel, P. A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c153t-1d10bfb0f712f04080187e44fa4ac61467c73c3fa67b570087d4826a0492da273</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Graphs</topic><topic>Labeling</topic><topic>Splitting</topic><toplevel>online_resources</toplevel><creatorcontrib>Prajapati, U. M.</creatorcontrib><creatorcontrib>Patel, P. A.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><jtitle>Communications in Mathematics and Applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Prajapati, U. M.</au><au>Patel, P. A.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Product Binary L-Cordial Labeling of Various Degree Splitting Graphs</atitle><jtitle>Communications in Mathematics and Applications</jtitle><date>2024-01-01</date><risdate>2024</risdate><volume>15</volume><issue>1</issue><spage>417</spage><epage>429</epage><pages>417-429</pages><issn>0976-5905</issn><eissn>0975-8607</eissn><abstract>This study examines the probability of the degree splitting operation results from various graphs being product binary L-cordial Graphs. The graphs under investigation include the Path graph (Pn), Comb graph (Pn ⊙ k1), Double comb graph (Pn ⊙ 2k1), Cycle graph (Cn), Shell graph (Sn) and Ladder graph (Ln). The application of product binary L-cordial labeling demonstrates that these analyzed graphs exhibit characteristics of product binary L-cordial graphs.</abstract><cop>Kingsville</cop><pub>RGN Publications</pub><doi>10.26713/cma.v15i1.2541</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0002-5362-7662</orcidid><orcidid>https://orcid.org/0000-0002-4594-0122</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0976-5905 |
| ispartof | Communications in Mathematics and Applications, 2024-01, Vol.15 (1), p.417-429 |
| issn | 0976-5905 0975-8607 |
| language | eng |
| recordid | cdi_proquest_journals_3049155824 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Graphs Labeling Splitting |
| title | Product Binary L-Cordial Labeling of Various Degree Splitting 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-16T13%3A07%3A19IST&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=Product%20Binary%20L-Cordial%20Labeling%20of%20Various%20Degree%20Splitting%20Graphs&rft.jtitle=Communications%20in%20Mathematics%20and%20Applications&rft.au=Prajapati,%20U.%20M.&rft.date=2024-01-01&rft.volume=15&rft.issue=1&rft.spage=417&rft.epage=429&rft.pages=417-429&rft.issn=0976-5905&rft.eissn=0975-8607&rft_id=info:doi/10.26713/cma.v15i1.2541&rft_dat=%3Cproquest_cross%3E3049155824%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=3049155824&rft_id=info:pmid/&rfr_iscdi=true |