On -labeling the almost-bipartite graph K_m,n+e

MaRDI QIDQ3568002zbMATH OpenFDO

Authors W. O'Hanlon, Erin R. Spicer, S. I. El-Zanati

Publication date 17 June 2010

zbMATH Keywords

\(\gamma\)-labeling\(G\)-designalmost-bipartite graph

Mathematics Subject Classification ID

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

Recommendations

• On \(\gamma \)-labeling the almost-bipartite graph \(P_m+e\).
• On cyclic \((C_{2m}+e)\)-designs
• On -labeling of the almost-bipartite graph (P_m P_n) + e
• On -labeling of the almost-bipartite graph (P_m P_n) P₄
• On the cyclic decomposition of complete graphs into almost-bipartite graphs

Cited in

(5)

• On \(\gamma \)-labeling the almost-bipartite graph \(P_m+e\).
• On cyclic \((C_{2m}+e)\)-designs
• On -labeling of the almost-bipartite graph (P_m P_n) + e
• \(\gamma\)-labeling of supersubdivided connected graph plus an edge
• On -labeling of the almost-bipartite graph (P_m P_n) P₄

This page was built for publication: On \(\gamma\)-labeling the almost-bipartite graph \(K_{m,n}+e\)

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