L(2, 1) Colouring and Radio Colouring of Some Graphs and its Parametrized Graphs
Graph Theory would not be what it is today without graph colouring. Graph colouring is the major part of discrete mathematics which is majorly used in network analysis. Radio colouring and L(2,1) colouring are cardinal topics in graph theory that associate many real life situation.The dominant role...
Gespeichert in:
Veröffentlicht in: | IAENG international journal of computer science 2024-11, Vol.51 (11), p.1740 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | 11 |
container_start_page | 1740 |
container_title | IAENG international journal of computer science |
container_volume | 51 |
creator | Rani, A Vimala |
description | Graph Theory would not be what it is today without graph colouring. Graph colouring is the major part of discrete mathematics which is majorly used in network analysis. Radio colouring and L(2,1) colouring are cardinal topics in graph theory that associate many real life situation.The dominant role of graph colouring is to partition the independent components which in turn is applied in practical solution of networks. The interference reduction problem is modeled as a graph coloring problem which is the principal keynote of study. There are several wellknown colouring parameters in graph theory. Here we deal with the following colouring parameters, radio number and span.The colouring parameters correlates the constrains of networks. In this article the span of sunlet, bistar, pencil graph families and radio number of Mycielski of cycle, bistar graphs are examined. Also, the comparison of span and radio number of some graph families are examined. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_3127680252</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3127680252</sourcerecordid><originalsourceid>FETCH-proquest_journals_31276802523</originalsourceid><addsrcrecordid>eNpjYuA0tDC01LU0MjJhgbLNTM0iOBi4iouzDAzMDQwMDDkZAnw0jHQUDDUVnPNz8kuLMvPSFRLzUhSCElMy85HE8tMUgvNzUxXcixILMorBSjJLihUCEosSc1NLijKrUlOgcjwMrGmJOcWpvFCam0HZzTXE2UO3oCi_sDS1uCQ-C2hmHlAq3tjQyNzMwsDI1MiYOFUAQYI-VQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3127680252</pqid></control><display><type>article</type><title>L(2, 1) Colouring and Radio Colouring of Some Graphs and its Parametrized Graphs</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Rani, A Vimala</creator><creatorcontrib>Rani, A Vimala</creatorcontrib><description>Graph Theory would not be what it is today without graph colouring. Graph colouring is the major part of discrete mathematics which is majorly used in network analysis. Radio colouring and L(2,1) colouring are cardinal topics in graph theory that associate many real life situation.The dominant role of graph colouring is to partition the independent components which in turn is applied in practical solution of networks. The interference reduction problem is modeled as a graph coloring problem which is the principal keynote of study. There are several wellknown colouring parameters in graph theory. Here we deal with the following colouring parameters, radio number and span.The colouring parameters correlates the constrains of networks. In this article the span of sunlet, bistar, pencil graph families and radio number of Mycielski of cycle, bistar graphs are examined. Also, the comparison of span and radio number of some graph families are examined.</description><identifier>ISSN: 1819-656X</identifier><identifier>EISSN: 1819-9224</identifier><language>eng</language><publisher>Hong Kong: International Association of Engineers</publisher><subject>Graph coloring ; Graph theory ; Graphs ; Network analysis ; Parameters</subject><ispartof>IAENG international journal of computer science, 2024-11, Vol.51 (11), p.1740</ispartof><rights>Copyright International Association of Engineers Nov 1, 2024</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784</link.rule.ids></links><search><creatorcontrib>Rani, A Vimala</creatorcontrib><title>L(2, 1) Colouring and Radio Colouring of Some Graphs and its Parametrized Graphs</title><title>IAENG international journal of computer science</title><description>Graph Theory would not be what it is today without graph colouring. Graph colouring is the major part of discrete mathematics which is majorly used in network analysis. Radio colouring and L(2,1) colouring are cardinal topics in graph theory that associate many real life situation.The dominant role of graph colouring is to partition the independent components which in turn is applied in practical solution of networks. The interference reduction problem is modeled as a graph coloring problem which is the principal keynote of study. There are several wellknown colouring parameters in graph theory. Here we deal with the following colouring parameters, radio number and span.The colouring parameters correlates the constrains of networks. In this article the span of sunlet, bistar, pencil graph families and radio number of Mycielski of cycle, bistar graphs are examined. Also, the comparison of span and radio number of some graph families are examined.</description><subject>Graph coloring</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Network analysis</subject><subject>Parameters</subject><issn>1819-656X</issn><issn>1819-9224</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNpjYuA0tDC01LU0MjJhgbLNTM0iOBi4iouzDAzMDQwMDDkZAnw0jHQUDDUVnPNz8kuLMvPSFRLzUhSCElMy85HE8tMUgvNzUxXcixILMorBSjJLihUCEosSc1NLijKrUlOgcjwMrGmJOcWpvFCam0HZzTXE2UO3oCi_sDS1uCQ-C2hmHlAq3tjQyNzMwsDI1MiYOFUAQYI-VQ</recordid><startdate>20241101</startdate><enddate>20241101</enddate><creator>Rani, A Vimala</creator><general>International Association of Engineers</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20241101</creationdate><title>L(2, 1) Colouring and Radio Colouring of Some Graphs and its Parametrized Graphs</title><author>Rani, A Vimala</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_31276802523</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Graph coloring</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Network analysis</topic><topic>Parameters</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rani, A Vimala</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science 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><jtitle>IAENG international journal of computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rani, A Vimala</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>L(2, 1) Colouring and Radio Colouring of Some Graphs and its Parametrized Graphs</atitle><jtitle>IAENG international journal of computer science</jtitle><date>2024-11-01</date><risdate>2024</risdate><volume>51</volume><issue>11</issue><spage>1740</spage><pages>1740-</pages><issn>1819-656X</issn><eissn>1819-9224</eissn><abstract>Graph Theory would not be what it is today without graph colouring. Graph colouring is the major part of discrete mathematics which is majorly used in network analysis. Radio colouring and L(2,1) colouring are cardinal topics in graph theory that associate many real life situation.The dominant role of graph colouring is to partition the independent components which in turn is applied in practical solution of networks. The interference reduction problem is modeled as a graph coloring problem which is the principal keynote of study. There are several wellknown colouring parameters in graph theory. Here we deal with the following colouring parameters, radio number and span.The colouring parameters correlates the constrains of networks. In this article the span of sunlet, bistar, pencil graph families and radio number of Mycielski of cycle, bistar graphs are examined. Also, the comparison of span and radio number of some graph families are examined.</abstract><cop>Hong Kong</cop><pub>International Association of Engineers</pub></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1819-656X |
ispartof | IAENG international journal of computer science, 2024-11, Vol.51 (11), p.1740 |
issn | 1819-656X 1819-9224 |
language | eng |
recordid | cdi_proquest_journals_3127680252 |
source | EZB-FREE-00999 freely available EZB journals |
subjects | Graph coloring Graph theory Graphs Network analysis Parameters |
title | L(2, 1) Colouring and Radio Colouring of Some Graphs and its Parametrized Graphs |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T20%3A55%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=L(2,%201)%20Colouring%20and%20Radio%20Colouring%20of%20Some%20Graphs%20and%20its%20Parametrized%20Graphs&rft.jtitle=IAENG%20international%20journal%20of%20computer%20science&rft.au=Rani,%20A%20Vimala&rft.date=2024-11-01&rft.volume=51&rft.issue=11&rft.spage=1740&rft.pages=1740-&rft.issn=1819-656X&rft.eissn=1819-9224&rft_id=info:doi/&rft_dat=%3Cproquest%3E3127680252%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3127680252&rft_id=info:pmid/&rfr_iscdi=true |