Cordialness of cycles with parallel P_k-chords and multiple subdivision graphs

zbMATH Open1224.05443MaRDI QIDQ3070195FDOQ3070195

Authors: A. Elumalai, G. Sethuraman 

Publication date: 2 February 2011

Recommendations

• The cordiality of the path-union of \(n\) copies of a graph
• Study of some problems of cordial graphs
• Some new results on cordial labeling in the context of arbitrary supersubdivision of graph
• scientific article
• Gracefulness of a cycle with parallel chords and parallel \(P_k\)-chords of different lengths.

zbMATH Keywords

cordial labelinggraph labeling\(P_k\)-parallel chordparallel chord

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (2)

• Some cordial graphs in the context of barycentric subdivision
• Title not available (Why is that?)

This page was built for publication: Cordialness of cycles with parallel \(P_k\)-chords and multiple subdivision graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070195)