Packing coloring on subdivision-vertex and subdivision-edge join of cycle Cm with path Pn

Author(s):  
K. Rajalakshmi ◽  
M. Venkatachalam ◽  
M. Barani ◽  
D. Dafik

The packing chromatic number $\chi_\rho$ of a graph $G$ is the smallest integer $k$ for which there exists a mapping $\pi$ from $V(G)$ to $\{1,2,...,k\}$ such that any two vertices of color $i$ are at distance at least $i+1$. In this paper, the authors find the packing chromatic number of subdivision vertex join of cycle graph with path graph and subdivision edge join of cycle graph with path graph.

2022 ◽  
Vol 18 (2) ◽  
pp. 161-168
Author(s):  
Junianto Sesa ◽  
Siswanto Siswanto

The development of graph theory has provided many new pieces of knowledge, one of them is graph color. Where the application is spread in various fields such as the coding index theory. Fractional coloring is multiple coloring at points with different colors where the adjoining point has a different color. The operation in the graph is known as the sum operation. Point coloring can be applied to graphs where the result of operations is from several special graphs.  In this case, the graph summation results of the path graph and the cycle graph will produce the same fractional chromatic number as the sum of the fractional chromatic numbers of each graph before it is operated.


Author(s):  
Albert William ◽  
Roy Santiago ◽  
Indra Rajasingh

2021 ◽  
Vol 33 (5) ◽  
pp. 66-73
Author(s):  
B. CHALUVARAJU ◽  
◽  
M. KUMARA ◽  

The packing chromatic number χ_{p}(G) of a graph G = (V,E) is the smallest integer k such that the vertex set V(G) can be partitioned into disjoint classes V1 ,V2 ,...,Vk , where vertices in Vi have pairwise distance greater than i. In this paper, we compute the packing chromatic number of circulant graphs with different jump sizes._{}


2018 ◽  
Vol 341 (2) ◽  
pp. 474-483 ◽  
Author(s):  
József Balogh ◽  
Alexandr Kostochka ◽  
Xujun Liu

2016 ◽  
Vol 5 (2) ◽  
pp. 132
Author(s):  
Essam El Seidy ◽  
Salah Eldin Hussein ◽  
Atef Mohamed

We consider a finite undirected and connected simple graph  with vertex set  and edge set .We calculated the general formulas of the spectra of a cycle graph and path graph. In this discussion we are interested in the adjacency matrix, Laplacian matrix, signless Laplacian matrix, normalized Laplacian matrix, and seidel adjacency matrix.


2021 ◽  
Vol 5 (2) ◽  
pp. 82
Author(s):  
A. Asmiati ◽  
Maharani Damayanti ◽  
Lyra Yulianti

The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph. The locating chromatic number of a graph is defined as the cardinality of the minimum color classes of the graph. In this paper, we discuss about the locating-chromatic number of shadow path graph and barbell graph containing shadow graph.


2015 ◽  
Vol 32 (4) ◽  
pp. 1313-1327 ◽  
Author(s):  
Boštjan Brešar ◽  
Sandi Klavžar ◽  
Douglas F. Rall

2021 ◽  
Vol 289 ◽  
pp. 185-193
Author(s):  
J. Fresán-Figueroa ◽  
D. González-Moreno ◽  
M. Olsen

Sign in / Sign up

Export Citation Format

Share Document