On the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts

On the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts

In this paper, we discuss the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts. We denote by K(p × q) the complete p-partite graph with cardinality q of each part. By constructing coloring in terms of the symmetry of regular polygons...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Fang Yang, Xiang-en Chen, Chunyan Ma, Bing Yao
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Clocks
Color
Educational institutions
Electronic mail
Graph theory
Information processing
Intelligent control
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 154
container_issue
container_start_page 150
container_title
container_volume
creator Fang Yang
Xiang-en Chen
Chunyan Ma
Bing Yao
description In this paper, we discuss the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts. We denote by K(p × q) the complete p-partite graph with cardinality q of each part. By constructing coloring in terms of the symmetry of regular polygons and the methods of combinatorial analysis, we will obtain vertex-distinguishing proper total chromatic numbers for K(p × q) when q = 2, 3, 4, 5, respectively.
doi_str_mv 10.1109/ICICIP.2013.6568058
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6568058</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6568058</ieee_id><sourcerecordid>6568058</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-a250a544ab63fba52283c7987143992fdbf3f984598a7c3240d2b7cadbacfa343</originalsourceid><addsrcrecordid>eNpVkMtOwzAQRY0QEqj0C7rxD6T4FT-WqOJRqVJZwLpyknFjlNbGdoH-PSl0g2ZxZ87VvYtBaEbJnFJi7paLcV7mjFA-l7XUpNYXaGqUpkIqLplQ4vLfrek1mub8TggZCySn8gYd13tcesCfkAp8V53Pxe-3B5_7UXBMIULCJRQ74DYMIY004-BwhjFxgoPNGX5RG3ZxgAI4VtGm4sdtm2zsM_7ypcfwcfAxFNgXfLLzLbpydsgwPesEvT0-vC6eq9X6abm4X1WeqrpUltXE1kLYRnLX2JoxzVtltKKCG8Nc1zjujBa10Va1nAnSsUa1tmts6ywXfIJmf70eADYx-Z1Nx835YfwHL65iPw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Fang Yang ; Xiang-en Chen ; Chunyan Ma ; Bing Yao</creator><creatorcontrib>Fang Yang ; Xiang-en Chen ; Chunyan Ma ; Bing Yao</creatorcontrib><description>In this paper, we discuss the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts. We denote by K(p × q) the complete p-partite graph with cardinality q of each part. By constructing coloring in terms of the symmetry of regular polygons and the methods of combinatorial analysis, we will obtain vertex-distinguishing proper total chromatic numbers for K(p × q) when q = 2, 3, 4, 5, respectively.</description><identifier>ISBN: 9781467362481</identifier><identifier>ISBN: 1467362484</identifier><identifier>EISBN: 9781467362474</identifier><identifier>EISBN: 1467362492</identifier><identifier>EISBN: 9781467362498</identifier><identifier>EISBN: 1467362476</identifier><identifier>DOI: 10.1109/ICICIP.2013.6568058</identifier><language>eng</language><publisher>IEEE</publisher><subject>Clocks ; Color ; Educational institutions ; Electronic mail ; Graph theory ; Information processing ; Intelligent control</subject><ispartof>2013 Fourth International Conference on Intelligent Control and Information Processing (ICICIP), 2013, p.150-154</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6568058$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6568058$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Fang Yang</creatorcontrib><creatorcontrib>Xiang-en Chen</creatorcontrib><creatorcontrib>Chunyan Ma</creatorcontrib><creatorcontrib>Bing Yao</creatorcontrib><title>On the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts</title><title>2013 Fourth International Conference on Intelligent Control and Information Processing (ICICIP)</title><addtitle>ICICIP</addtitle><description>In this paper, we discuss the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts. We denote by K(p × q) the complete p-partite graph with cardinality q of each part. By constructing coloring in terms of the symmetry of regular polygons and the methods of combinatorial analysis, we will obtain vertex-distinguishing proper total chromatic numbers for K(p × q) when q = 2, 3, 4, 5, respectively.</description><subject>Clocks</subject><subject>Color</subject><subject>Educational institutions</subject><subject>Electronic mail</subject><subject>Graph theory</subject><subject>Information processing</subject><subject>Intelligent control</subject><isbn>9781467362481</isbn><isbn>1467362484</isbn><isbn>9781467362474</isbn><isbn>1467362492</isbn><isbn>9781467362498</isbn><isbn>1467362476</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkMtOwzAQRY0QEqj0C7rxD6T4FT-WqOJRqVJZwLpyknFjlNbGdoH-PSl0g2ZxZ87VvYtBaEbJnFJi7paLcV7mjFA-l7XUpNYXaGqUpkIqLplQ4vLfrek1mub8TggZCySn8gYd13tcesCfkAp8V53Pxe-3B5_7UXBMIULCJRQ74DYMIY004-BwhjFxgoPNGX5RG3ZxgAI4VtGm4sdtm2zsM_7ypcfwcfAxFNgXfLLzLbpydsgwPesEvT0-vC6eq9X6abm4X1WeqrpUltXE1kLYRnLX2JoxzVtltKKCG8Nc1zjujBa10Va1nAnSsUa1tmts6ywXfIJmf70eADYx-Z1Nx835YfwHL65iPw</recordid><startdate>201306</startdate><enddate>201306</enddate><creator>Fang Yang</creator><creator>Xiang-en Chen</creator><creator>Chunyan Ma</creator><creator>Bing Yao</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201306</creationdate><title>On the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts</title><author>Fang Yang ; Xiang-en Chen ; Chunyan Ma ; Bing Yao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-a250a544ab63fba52283c7987143992fdbf3f984598a7c3240d2b7cadbacfa343</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Clocks</topic><topic>Color</topic><topic>Educational institutions</topic><topic>Electronic mail</topic><topic>Graph theory</topic><topic>Information processing</topic><topic>Intelligent control</topic><toplevel>online_resources</toplevel><creatorcontrib>Fang Yang</creatorcontrib><creatorcontrib>Xiang-en Chen</creatorcontrib><creatorcontrib>Chunyan Ma</creatorcontrib><creatorcontrib>Bing Yao</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fang Yang</au><au>Xiang-en Chen</au><au>Chunyan Ma</au><au>Bing Yao</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts</atitle><btitle>2013 Fourth International Conference on Intelligent Control and Information Processing (ICICIP)</btitle><stitle>ICICIP</stitle><date>2013-06</date><risdate>2013</risdate><spage>150</spage><epage>154</epage><pages>150-154</pages><isbn>9781467362481</isbn><isbn>1467362484</isbn><eisbn>9781467362474</eisbn><eisbn>1467362492</eisbn><eisbn>9781467362498</eisbn><eisbn>1467362476</eisbn><abstract>In this paper, we discuss the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts. We denote by K(p × q) the complete p-partite graph with cardinality q of each part. By constructing coloring in terms of the symmetry of regular polygons and the methods of combinatorial analysis, we will obtain vertex-distinguishing proper total chromatic numbers for K(p × q) when q = 2, 3, 4, 5, respectively.</abstract><pub>IEEE</pub><doi>10.1109/ICICIP.2013.6568058</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9781467362481
ispartof 2013 Fourth International Conference on Intelligent Control and Information Processing (ICICIP), 2013, p.150-154
issn
language eng
recordid cdi_ieee_primary_6568058
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Clocks
Color
Educational institutions
Electronic mail
Graph theory
Information processing
Intelligent control
title On the vertex-distinguishing proper total colorings of several classes of complete p-partite graphs with equipotent parts
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T16%3A55%3A24IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20the%20vertex-distinguishing%20proper%20total%20colorings%20of%20several%20classes%20of%20complete%20p-partite%20graphs%20with%20equipotent%20parts&rft.btitle=2013%20Fourth%20International%20Conference%20on%20Intelligent%20Control%20and%20Information%20Processing%20(ICICIP)&rft.au=Fang%20Yang&rft.date=2013-06&rft.spage=150&rft.epage=154&rft.pages=150-154&rft.isbn=9781467362481&rft.isbn_list=1467362484&rft_id=info:doi/10.1109/ICICIP.2013.6568058&rft_dat=%3Cieee_6IE%3E6568058%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781467362474&rft.eisbn_list=1467362492&rft.eisbn_list=9781467362498&rft.eisbn_list=1467362476&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6568058&rfr_iscdi=true