NEPS operations on cordial graphs

DOI10.1016/0012-365X(93)90489-GzbMATH Open0792.05100MaRDI QIDQ1801699FDOQ1801699

Authors: W. Kirchherr 

Publication date: 20 June 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• When is NEPS of graphs connected?
• scientific article; zbMATH DE number 591048
• The cordiality of the path-union of \(n\) copies of a graph
• GCD-graphs and NEPS of complete graphs
• When can the components of NEPS of connected bipartite graphs be almost cospectral?

zbMATH Keywords

partitionadjacency matrixcharacterizationcordial graphsnon-complete extended \(p\)-sum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• On Additive Bases and Harmonious Graphs
• Title not available (Why is that?)
• Boolean Operations on Graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

• Uniformly cordial graphs
• Cordial labeling of \(mK_ n\)
• On friendly index sets of 2-regular graphs
• Diameter of the NEPS of bipartite graphs
• On total edge product cordial labeling of fullerenes
• Title not available (Why is that?)
• GCD-graphs and NEPS of complete graphs
• On 3-total edge product cordial labeling of a carbon nanotube network
• A guide to the graph labeling zoo
• On \(3\)-total edge product cordial labeling of honeycomb
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: NEPS operations on cordial graphs

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