Abstract
The line graph L(G) of a graph G is the graph whose vertex set is E(G) and two vertices are adjacent in L(G) whenever they are incident in G. In this paper we have investigated product cordial labeling of line graph of some product cordial graphs.
Author supplied keywords
Cite
CITATION STYLE
APA
Vaidya, S. K., & Barasara, C. M. (2016). Product cordial labeling of line graph of some graphs. Kragujevac Journal of Mathematics, 40(2), 290–297. https://doi.org/10.5937/KgJMath1602290V
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free