Object

Title: On the Achromatic Index of Complete Graphs

Co-author(s) :

Petrosyan Petros A.

Abstract:

A proper edge-coloring of a graph G is a mapping α : E(G) → N such that α(e) 6= α(e 0 ) for every pair of adjacent edges e, e0 ∈ E(G). A proper edge-coloring of a graph G with colors 1, . . . , t is called a complete t-edgecoloring if for every pair of colors i and j, there are two edges with a common vertex, one colored by i and the other colored by j. The largest value of t for which G has a complete t-edge-coloring is called the achromatic index ψ 0 (G) of G. In this paper we study the achromatic index of complete and complete bipartite graphs. In particular, we prove that for any m, n ∈ N, ψ 0 (Km+n+1) ≥ ψ 0 (Km,n)+m+n−1. We also prove that for any m, n ∈ N, ψ 0 (Km,n) ≥ ψ 0 K m (m,n) , n (m,n) ψ 0 K(m,n) + 1 , where (m, n) is the greatest common divisor of m and n

Identifier:

oai:noad.sci.am:135801

Language:

English

URL:


Additional Information:

narek.hnh@gmail.com ; pet petros@ipia.sci.am

Affiliation:

Yerevan State University ; YSU Information Technologies Educationaland Reasearch Center ; Institute for Informatics and Automation Problems

Country:

Armenia

Year:

2017

Time period:

September25-29

Conference title:

11th International Conference on Computer Science and Information Technologies CSIT 2017

Place:

Yerevan

Participation type:

oral

Object collections:

Last modified:

Mar 3, 2021

In our library since:

Jul 16, 2020

Number of object content hits:

10

All available object's versions:

https://noad.sci.am/publication/149328

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

This page uses 'cookies'. More information