Some results on the distance r-b-coloring in graphs
Given a positive integer r, two vertices u; v 2 V (G) are r- independent if d(u; v) > r. A partition of V (G) into r-independent sets is called a distance r-coloring. A study of distance r-coloring and distance r-b-coloring concepts are studied in this paper.
Gespeichert in:
Veröffentlicht in: | TWMS journal of applied and engineering mathematics 2016-07, Vol.6 (2), p.315 |
---|---|
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 | |
---|---|
container_issue | 2 |
container_start_page | 315 |
container_title | TWMS journal of applied and engineering mathematics |
container_volume | 6 |
creator | Jothilakshmi, G Pushpalatha, A.P Suganthi, S Swaminathan, V |
description | Given a positive integer r, two vertices u; v 2 V (G) are r- independent if d(u; v) > r. A partition of V (G) into r-independent sets is called a distance r-coloring. A study of distance r-coloring and distance r-b-coloring concepts are studied in this paper. |
format | Article |
fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_2055205574</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A491087657</galeid><sourcerecordid>A491087657</sourcerecordid><originalsourceid>FETCH-LOGICAL-g180t-8e50f5f2d6d26e8d02a064651277e21b33eec9e344b3d68c63e4bb49cf8519d33</originalsourceid><addsrcrecordid>eNptjctqwzAQRUVpoSHNPxi6dtFb8jKEviCQRdu1saWRo2BLqWT_f1VaaBadyzDD5dyZK7SihMuaEK6uL_ZbtMn5hEtpKRVmK8Te4gRVgryMc65iqOYjVNbnuQum-HVfmzjG5MNQ-VANqTsf8x26cd2YYfM71-jj6fF991LvD8-vu-2-HojGc61BYCcctdJSCdpi2mHJpSBUKaCkZwzANMA475mV2kgGvO95Y5wWpLGMrdH9z91zip8L5Lk9xSWF8rKlWIjvVvyPGroRWh9cnFNnJp9Nu-UNwVpJoQr18A9VZGHyJgZwvvgXgS_HnFyb</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2055205574</pqid></control><display><type>article</type><title>Some results on the distance r-b-coloring in graphs</title><source>EZB*</source><creator>Jothilakshmi, G ; Pushpalatha, A.P ; Suganthi, S ; Swaminathan, V</creator><creatorcontrib>Jothilakshmi, G ; Pushpalatha, A.P ; Suganthi, S ; Swaminathan, V</creatorcontrib><description>Given a positive integer r, two vertices u; v 2 V (G) are r- independent if d(u; v) > r. A partition of V (G) into r-independent sets is called a distance r-coloring. A study of distance r-coloring and distance r-b-coloring concepts are studied in this paper.</description><identifier>ISSN: 2146-1147</identifier><identifier>EISSN: 2146-1147</identifier><language>eng</language><publisher>Istanbul: Turkic World Mathematical Society</publisher><subject>Coloring ; Graph theory ; Mathematical research ; Product design</subject><ispartof>TWMS journal of applied and engineering mathematics, 2016-07, Vol.6 (2), p.315</ispartof><rights>COPYRIGHT 2016 Turkic World Mathematical Society</rights><rights>Copyright Elman Hasanoglu 2016</rights><lds50>peer_reviewed</lds50><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</link.rule.ids></links><search><creatorcontrib>Jothilakshmi, G</creatorcontrib><creatorcontrib>Pushpalatha, A.P</creatorcontrib><creatorcontrib>Suganthi, S</creatorcontrib><creatorcontrib>Swaminathan, V</creatorcontrib><title>Some results on the distance r-b-coloring in graphs</title><title>TWMS journal of applied and engineering mathematics</title><description>Given a positive integer r, two vertices u; v 2 V (G) are r- independent if d(u; v) > r. A partition of V (G) into r-independent sets is called a distance r-coloring. A study of distance r-coloring and distance r-b-coloring concepts are studied in this paper.</description><subject>Coloring</subject><subject>Graph theory</subject><subject>Mathematical research</subject><subject>Product design</subject><issn>2146-1147</issn><issn>2146-1147</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNptjctqwzAQRUVpoSHNPxi6dtFb8jKEviCQRdu1saWRo2BLqWT_f1VaaBadyzDD5dyZK7SihMuaEK6uL_ZbtMn5hEtpKRVmK8Te4gRVgryMc65iqOYjVNbnuQum-HVfmzjG5MNQ-VANqTsf8x26cd2YYfM71-jj6fF991LvD8-vu-2-HojGc61BYCcctdJSCdpi2mHJpSBUKaCkZwzANMA475mV2kgGvO95Y5wWpLGMrdH9z91zip8L5Lk9xSWF8rKlWIjvVvyPGroRWh9cnFNnJp9Nu-UNwVpJoQr18A9VZGHyJgZwvvgXgS_HnFyb</recordid><startdate>20160701</startdate><enddate>20160701</enddate><creator>Jothilakshmi, G</creator><creator>Pushpalatha, A.P</creator><creator>Suganthi, S</creator><creator>Swaminathan, V</creator><general>Turkic World Mathematical Society</general><general>Elman Hasanoglu</general><scope>3V.</scope><scope>7TB</scope><scope>7XB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>EDSIH</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>KR7</scope><scope>L6V</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>PADUT</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20160701</creationdate><title>Some results on the distance r-b-coloring in graphs</title><author>Jothilakshmi, G ; Pushpalatha, A.P ; Suganthi, S ; Swaminathan, V</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-g180t-8e50f5f2d6d26e8d02a064651277e21b33eec9e344b3d68c63e4bb49cf8519d33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Coloring</topic><topic>Graph theory</topic><topic>Mathematical research</topic><topic>Product design</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jothilakshmi, G</creatorcontrib><creatorcontrib>Pushpalatha, A.P</creatorcontrib><creatorcontrib>Suganthi, S</creatorcontrib><creatorcontrib>Swaminathan, V</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</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>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>ProQuest Turkey Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Research Library China</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>ProQuest Central Basic</collection><jtitle>TWMS journal of applied and engineering mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jothilakshmi, G</au><au>Pushpalatha, A.P</au><au>Suganthi, S</au><au>Swaminathan, V</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Some results on the distance r-b-coloring in graphs</atitle><jtitle>TWMS journal of applied and engineering mathematics</jtitle><date>2016-07-01</date><risdate>2016</risdate><volume>6</volume><issue>2</issue><spage>315</spage><pages>315-</pages><issn>2146-1147</issn><eissn>2146-1147</eissn><abstract>Given a positive integer r, two vertices u; v 2 V (G) are r- independent if d(u; v) > r. A partition of V (G) into r-independent sets is called a distance r-coloring. A study of distance r-coloring and distance r-b-coloring concepts are studied in this paper.</abstract><cop>Istanbul</cop><pub>Turkic World Mathematical Society</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2146-1147 |
ispartof | TWMS journal of applied and engineering mathematics, 2016-07, Vol.6 (2), p.315 |
issn | 2146-1147 2146-1147 |
language | eng |
recordid | cdi_proquest_journals_2055205574 |
source | EZB* |
subjects | Coloring Graph theory Mathematical research Product design |
title | Some results on the distance r-b-coloring in graphs |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T19%3A43%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Some%20results%20on%20the%20distance%20r-b-coloring%20in%20graphs&rft.jtitle=TWMS%20journal%20of%20applied%20and%20engineering%20mathematics&rft.au=Jothilakshmi,%20G&rft.date=2016-07-01&rft.volume=6&rft.issue=2&rft.spage=315&rft.pages=315-&rft.issn=2146-1147&rft.eissn=2146-1147&rft_id=info:doi/&rft_dat=%3Cgale_proqu%3EA491087657%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2055205574&rft_id=info:pmid/&rft_galeid=A491087657&rfr_iscdi=true |