Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Proper Connection Number of Graph Products

Proper Connection Number of Graph Products A path P in an edge-colored graph G is called a proper path if no two adjacent edges of P are colored the same, and G is proper connected if every two vertices of G are connected by a proper path in G. The proper connection number of a connected graph G, denoted by pc(G), is the minimum number of colors that are needed to make G proper connected. In this paper, we study the proper connection number on the lexicographic, strong, Cartesian, and direct products and present exact values or upper bounds for these products of graphs. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Bulletin of the Malaysian Mathematical Sciences Society Springer Journals

Loading next page...
 
/lp/springer-journals/proper-connection-number-of-graph-products-HMSbcctTVK

References (37)

Publisher
Springer Journals
Copyright
Copyright © 2017 by Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia
Subject
Mathematics; Mathematics, general; Applications of Mathematics
ISSN
0126-6705
eISSN
2180-4206
DOI
10.1007/s40840-016-0442-z
Publisher site
See Article on Publisher Site

Abstract

A path P in an edge-colored graph G is called a proper path if no two adjacent edges of P are colored the same, and G is proper connected if every two vertices of G are connected by a proper path in G. The proper connection number of a connected graph G, denoted by pc(G), is the minimum number of colors that are needed to make G proper connected. In this paper, we study the proper connection number on the lexicographic, strong, Cartesian, and direct products and present exact values or upper bounds for these products of graphs.

Journal

Bulletin of the Malaysian Mathematical Sciences SocietySpringer Journals

Published: Feb 22, 2017

There are no references for this article.