NEPS operations on cordial graphs

DOI10.1016/0012-365X(93)90489-GzbMath0792.05100MaRDI QIDQ1801699

Walter W. Kirchherr

Publication date: 20 June 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

partitioncharacterizationadjacency matrixcordial graphsnon-complete extended \(p\)-sum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (9)

A guide to the graph labeling zoo ⋮ Cordial labeling of \(mK_ n\) ⋮ On 3-total edge product cordial labeling of a carbon nanotube network ⋮ On \(3\)-total edge product cordial labeling of honeycomb ⋮ Unnamed Item ⋮ Uniformly cordial graphs ⋮ On friendly index sets of 2-regular graphs ⋮ Unnamed Item ⋮ On total edge product cordial labeling of fullerenes

Cites Work

• On Additive Bases and Harmonious Graphs
• Boolean Operations on Graphs.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: NEPS operations on cordial graphs