scientific article; zbMATH DE number 19195

MaRDI QIDQ3976625zbMATH OpenFDO

Authors W. Kirchherr

Publication date 26 June 1992

zbMATH Keywords

adjacency matricescordial graphsgraph labelling

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Study of some problems of cordial graphs
• scientific article; zbMATH DE number 94970
• scientific article; zbMATH DE number 4210188
• scientific article; zbMATH DE number 3997850
• The cordiality of one-point union of n copies of a graph

Cited in

(8)

• Cordial labeling of \(mK_ n\)
• Uniformly cordial graphs
• Study of some problems of cordial graphs
• scientific article; zbMATH DE number 4210188 (Why is no real title available?)
• scientific article; zbMATH DE number 4085079 (Why is no real title available?)
• scientific article; zbMATH DE number 94970 (Why is no real title available?)
• scientific article; zbMATH DE number 7527893 (Why is no real title available?)
• On friendly index sets of 2-regular graphs

This page was built for publication:

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