TITLE

# Further results on partition dimension of corona products

AUTHOR(S)
PUB. DATE
May 2012
SOURCE
AIP Conference Proceedings;5/22/2012, Vol. 1450 Issue 1, p77
SOURCE TYPE
DOC. TYPE
Article
ABSTRACT
The problem of finding of the partition dimension for a general graph is an NP-hard problem. Therefore, many studies of partition dimension of graphs are focused on particular classes of graphs. In this paper, we are interested in determining the partition dimension for the resulting graphs produced by the corona product between two graphs. In specific, we consider the partition dimension of the corona graphs K1âŠ™mKn, PmâŠ™K1,n and K1,mâŠ™Kn where Pm,K1,n and Kn are a path order m, a star order n+1 and a complete graph order n, respectively.
ACCESSION #
75527011

## Related Articles

• RAINBOW CONNECTION NUMBER OF DENSE GRAPHS. XUELIANG LI; MENGMENG LIU; SCHIERMEYER, INGO // Discussiones Mathematicae: Graph Theory;2013, Vol. 33 Issue 3, p603

An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this paper we...

• Characterizing all graphs containing cycles with locating-chromatic number 3. Asmiati; Baskoro, Edy Tri // AIP Conference Proceedings;5/22/2012, Vol. 1450 Issue 1, p351

Let G be a connected graph G. Let c be a k-coloring of V(G) which induces an ordered partition Î  = {S1,S2, ...,Sk} of V(G), where Si is the set of vertices receiving color i. The color code cÎ (Î½) of vertex Î½ is the ordered k-tuple (d(Î½,S1), d(Î½, S2), ..., d(Î½, Sk)), where...

• Rainbow Connection in 3-Connected Graphs. Li, Xueliang; Shi, Yongtang // Graphs & Combinatorics;Sep2013, Vol. 29 Issue 5, p1471

An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted by rc( G), is the smallest number of colors that are needed in order to make G rainbow connected. In this...

• Exponents of two-colored digraphs consisting of two cycles. Suwilo, Saib // AIP Conference Proceedings;5/22/2012, Vol. 1450 Issue 1, p297

A two-colored digraph D(2) is a digraph D whose each of its arc is colored by either red or blue. For nonnegative integers s and t with s+t > 0, an (s, t)-walk in a two-colored digraph is a walk of length s+t consisting of s red arcs and t blue arcs. The vector (s, t)T is the composition of the...

• THE CROSSING NUMBERS OF PRODUCTS OF PATH WITH GRAPHS OF ORDER SIX. KLEŠČ, MARIÁN; PETRILLOVÁ, JANA // Discussiones Mathematicae: Graph Theory;2013, Vol. 33 Issue 3, p571

The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products Gâ–¡Pn for all connected graphs G on five vertices are also known. In this paper, the crossing numbers...

• VERTEX-DISTINGUISHING EDGE-COLORINGS OF LINEAR FORESTS. Cichacz, Sylwia; Przybyło, Jakub // Discussiones Mathematicae: Graph Theory;2010, Vol. 30 Issue 1, p95

In the PhD thesis by Burris (Memphis (1993)), a conjecture was made concerning the number of colors c(G) required to edge-color a simple graph G so that no two distinct vertices are incident to the same multiset of colors. We find the exact value of c(G) â€” the irregular coloring number,...

• Nordhaus-Gaddum-Type Theorem for Rainbow Connection Number of Graphs. Chen, Lily; Li, Xueliang; Lian, Huishu // Graphs & Combinatorics;Sep2013, Vol. 29 Issue 5, p1235

An edge-colored graph G is rainbow connected if every two vertices of G are connected by a path whose edges have distinct colors. The rainbow connection number of G, denoted by rc( G), is the minimum number of colors that are needed to make G rainbow connected. In this paper we give a...

• Facial Parity 9-Edge-Coloring of Outerplane Graphs. Bálint, Tomáš; Czap, Július // Graphs & Combinatorics;Sep2015, Vol. 31 Issue 5, p1177

A facial parity edge-coloring of a \$\$2\$\$ -edge-connected plane graph is such an edge-coloring in which no two face-adjacent edges receive the same color and in addition, for each face \$\$f\$\$ and each color \$\$c\$\$ either no edge or an odd number of edges incident with \$\$f\$\$ is colored with \$\$c\$\$ ....

• On the Rainbow Coloring for Some Graph Operations. Dafik; Ika Hesti Agustin; Fajariyato, Anang; Alfarisi, Ridho // AIP Conference Proceedings;2016, Vol. 1707 Issue 1, p1

Let G = (V,E) be a nontrivial, finite, simple and undirected connected graph on which is defined a coloring f : E(G)â†’{1,2, ...,k}, k âˆˆ N. The adjacent edges may be colored the same colors. A path in an edge colored graph is said to be a rainbow path if no two edges on the path have...

Share