Vertex-distinguishing edge colorings of some complete multipartite graphs
Închide
Articolul precedent
Articolul urmator
257 6
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:
 
Disponibil în IBN: 30 iunie 2021


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

Crossref XML Export

<?xml version='1.0' encoding='utf-8'?>
<doi_batch version='4.3.7' xmlns='http://www.crossref.org/schema/4.3.7' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.crossref.org/schema/4.3.7 http://www.crossref.org/schema/deposit/crossref4.3.7.xsd'>
<head>
<doi_batch_id>ibn-134236</doi_batch_id>
<timestamp>1711663704</timestamp>
<depositor>
<depositor_name>Information Society Development Instiute, Republic of Moldova</depositor_name>
<email_address>idsi@asm.md</email_address>
</depositor>
</head>
<body>
<collection>
<collection_metadata>
<full_title>Mathematics and IT: Research and Education</full_title>
</collection_metadata>
<collection_issue>
<publication_date media_type='print'>
<year>2021</year>
</publication_date>
</collection_issue>
<collection_article publication_type='full_text'><titles>
<title>Vertex-distinguishing edge colorings of some complete multipartite graphs</title>
</titles>
<contributors>
<person_name sequence='first' contributor_role='author'>
<given_name>Tigran</given_name>
<surname>Petrosyan</surname>
</person_name>
<person_name sequence='additional' contributor_role='author'>
<given_name>Petros</given_name>
<surname>Petrosyan</surname>
</person_name>
</contributors>
<publication_date media_type='print'>
<year>2021</year>
</publication_date>
<pages>
<first_page>69</first_page>
<last_page>70</last_page>
</pages>
</collection_article>
</collection>
</body>
</doi_batch>