Vertex-distinguishing edge colorings of some complete multipartite graphs
Închide
Articolul precedent
Articolul urmator
130 5
Ultima descărcare din IBN:
2022-06-04 12:26
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
 
Proiect:
7 Ihtioparaziţii ca indicatori biologici ai stării mediului acvatic şi organismului peştelui-gazdă
 
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