Vertex-distinguishing edge colorings of some complete multipartite graphs

Petrosyan Tigran; Petrosyan Petros

Articolul precedent

Articolul urmator

274

Ultima descărcare din IBN:
2023-05-17 20:20

SM ISO690:2012

PETROSYAN, Tigran, PETROSYAN, Petros. Vertex-distinguishing edge colorings of some complete multipartite graphs. In: Mathematics and IT: Research and Education, 1-3 iulie 2021, Chişinău. Chișinău, Republica Moldova: 2021, pp. 69-70.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Mathematics and IT: Research and Education 2021

Conferința "Mathematics and IT: Research and Education "
Chişinău, Moldova, 1-3 iulie 2021

Vertex-distinguishing edge colorings of some complete multipartite graphs

Pag. 69-70

Petrosyan Tigran, Petrosyan Petros

Russian-Armenian (Slavonic) University, Yerevan

Proiecte:

7 Ihtioparaziţii ca indicatori biologici ai stării mediului acvatic şi organismului peştelui-gazdă

Disponibil în IBN: 30 iunie 2021

Descarcă PDF

Rezumat

Let G be an undirected graph without multiple edges and loops, V(G) be the set of vertices of the graph G, E(G) be the set of edges of the graph G. Denote by Kn;Km;n;Kl;m;n, respectively, a complete graph with n vertices, a complete bipartite graph with m vertices in one partition and with n vertices in another, a complete tripartite graph with l vertices in one partition, m vertices in the other part, and n vertices in the third partition. Terminologies and notations not defined here can be found in [6]. A proper edge coloring f of a graph G is called vertex-distinguishing if for any different vertices u; v 2 V (G); S(u; f) 6= S(v; f): The minimum number of colors required for a vertex-distinguishing proper edge coloring of a simple graph G is denoted by Â0 vd(G): The definition of vertex-distinguishing edge coloring of a graph was introduced in [1,2] and, independently, as the “observability” of a graph in [3-5]. In this work we obtain some results on vertex-distinguishing edge colorings of complete 3- and 4-partite graphs. In particular, the following results hold. Theorem 1. Let l,m and n be any natural numbers. Then formula

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-134236</cfResPublId>
<cfResPublDate>2021</cfResPublDate>
<cfStartPage>69</cfStartPage>
<cfISBN></cfISBN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/134236</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>Vertex-distinguishing edge colorings of some complete multipartite graphs</cfTitle>
<cfAbstr cfLangCode='EN' cfTrans='o'><p>Let G be an undirected graph without multiple edges and loops, V(G) be the set of vertices of the graph G, E(G) be the set of edges of the graph G. Denote by Kn;Km;n;Kl;m;n, respectively, a complete graph with n vertices, a complete bipartite graph with m vertices in one partition and with n vertices in another, a complete tripartite graph with l vertices in one partition, m vertices in the other part, and n vertices in the third partition. Terminologies and notations not defined here can be found in [6]. A proper edge coloring f of a graph G is called vertex-distinguishing if for any different vertices u; v 2 V (G); S(u; f) 6= S(v; f): The minimum number of&nbsp;colors required for a vertex-distinguishing proper edge coloring of a simple graph G is denoted by &Acirc;0 vd(G): The definition of vertex-distinguishing edge coloring of a graph was introduced in [1,2] and, independently, as the &ldquo;observability&rdquo; of a graph in [3-5]. In this work we obtain some results on vertex-distinguishing edge colorings of complete 3- and 4-partite graphs. In particular, the following results hold. Theorem 1. Let l,m and n be any natural numbers. Then formula</p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2021T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2021T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-90495</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2021T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-90463</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2021T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-90495</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-90495-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2021T24:00:00</cfStartDate>
<cfFamilyNames>Petrosyan</cfFamilyNames>
<cfFirstNames>Tigran</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-90463</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-90463-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2021T24:00:00</cfStartDate>
<cfFamilyNames>Petrosyan</cfFamilyNames>
<cfFirstNames>Petros</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>