Articolul precedent |
Articolul urmator |
282 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, Ed. 2021, 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 " 2021, Chişinău, Moldova, 1-3 iulie 2021 | |||||||
|
|||||||
Pag. 69-70 | |||||||
|
|||||||
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 |
|||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Petrosyan, T.</creatorName> <affiliation>Russian-Armenian (Slavonic) University, Yerevan, Armenia</affiliation> </creator> <creator> <creatorName>Petrosyan, P.</creatorName> <affiliation>Russian-Armenian (Slavonic) University, Yerevan, Armenia</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Vertex-distinguishing edge colorings of some complete multipartite graphs</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2021</publicationYear> <relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'></relatedIdentifier> <dates> <date dateType='Issued'>2021</date> </dates> <resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><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 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</p></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>