Some methods of labeling graphs

zbMATH Open1236.05173MaRDI QIDQ717754FDOQ717754

Authors: M. A. Seoud, S. S. Abd El Rehim, A. Elsonbaty 

Publication date: 5 October 2011

Published in: Journal of the Egyptian Mathematical Society (Search for Journal in Brave)

Recommendations

• On cordial and balanced labelings of graphs
• A dynamic survey of graph labeling
• scientific article; zbMATH DE number 3997850
• Further results on \((\alpha_1,\alpha_2,\dots,\alpha_K)\) cordial labeling of graphs
• Prime and prime cordial labeling for some special graphs

zbMATH Keywords

labelinggraphs \(k\)-balanced labeling

Mathematics Subject Classification ID

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

Cited In (4)

• Orthogonal labelings of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Upper bounds of four types of graph labelings.

This page was built for publication: Some methods of labeling graphs

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