Upper bounds of four types of graph labelings.

MaRDI QIDQ2829048zbMATH OpenFDO

Authors M. A. Seoud, M. A. Salim

Publication date 26 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

\(k\)-equitable labeling(\(k,d\))-odd mean labeling\(Z_2\bigoplus Z_2\)-cordial labelingprime cordial labeling

Mathematics Subject Classification ID

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

Recommendations

• Two upper bounds of prime cordial graphs
• On cordial and balanced labelings of graphs
• Some methods of labeling graphs
• 4-prime cordial labeling of some special graphs
• scientific article; zbMATH DE number 7008862

Cited in

(2)

• Two upper bounds of prime cordial graphs
• (2, 3)-cordial trees and paths

This page was built for publication: Upper bounds of four types of graph labelings.

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