On graceful graphs: Union of n copies of edge deleted subgraphs of K₄

MaRDI QIDQ1307656zbMATH OpenFDO

Authors G. Sethuraman, S. Pitchai Muthu Kishore

Publication date 16 February 2000

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

graceful graphsgraceful numberinggraph labeling

Mathematics Subject Classification ID

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

Review text

A graceful numbering of a graph \(G=(V,E)\) with \(m\) edges is an injection \(f\colon V\to \{0,1, \dots, m\}\) such that, when each edge \(\{v,u\}\) is assigned the label \(|f(u) - f(v)|\), the resulting edge labels are distinct. The authors determine when the union of \(n\) copies of \(G\) with one edge in common is graceful, where \(G\) is a certain edge deleted subgraph of \(K_4\).

Recommendations

• scientific article; zbMATH DE number 2170453
• New classes of graceful graphs.
• Graceful labeling of the union of some graphs
• Graceful labelings of nearly complete graphs
• Graceful numbering of an edge-gluing of shell graphs

Cited in

(2)

• Graceful numbering of an edge-gluing of shell graphs
• scientific article; zbMATH DE number 2170453 (Why is no real title available?)

This page was built for publication: On graceful graphs: Union of \(n\) copies of edge deleted subgraphs of \(K_4\)

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