NEPS operations on cordial graphs

DOI10.1016/0012-365X(93)90489-GMaRDI QIDQ1801699zbMATH OpenFDO

Authors W. Kirchherr

Publication date 20 June 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(93)90489-G

zbMATH Keywords

adjacency matrixcharacterizationcordial graphsnon-complete extended \(p\)-sumpartition

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)

Review text

Let nearly equal mean differing by at most one. A graph is cordial if there exists a partition of the vertex set into subsets of nearly equal sizes such that the set of edges connecting vertices from different subsets is nearly equal in size to the set of remaining edges. The author gives an adjacency matrix characterization of cordial graphs and investigates conditions under which the non-complete extended \(p\)-sum (NEPS; introduced by the reviewer and \textit{R. P. Lučić} [Publ. Fac. Elektrotechn. Univ. Belgrade, Sér. Math. Phys. 302-319, 67-71 (1970; Zbl 0209.282)] of cordial graphs is cordial.

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?

Cites work

• Boolean Operations on Graphs.
• scientific article; zbMATH DE number 4179408 (Why is no real title available?)
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3728287 (Why is no real title available?)
• scientific article; zbMATH DE number 3997850 (Why is no real title available?)
• scientific article; zbMATH DE number 3333201 (Why is no real title available?)
• scientific article; zbMATH DE number 3377258 (Why is no real title available?)
• On Additive Bases and Harmonious Graphs

Cited in

(13)

• A guide to the graph labeling zoo
• Cordial labeling of \(mK_ n\)
• Diameter of the NEPS of bipartite graphs
• On 3-total edge product cordial labeling of a carbon nanotube network
• On \(3\)-total edge product cordial labeling of honeycomb
• Uniformly cordial graphs
• scientific article; zbMATH DE number 3908461 (Why is no real title available?)
• On total edge product cordial labeling of fullerenes
• scientific article; zbMATH DE number 7527893 (Why is no real title available?)
• GCD-graphs and NEPS of complete graphs
• scientific article; zbMATH DE number 2230299 (Why is no real title available?)
• The NEPS of gain graphs over arbitrary groups and its spectra
• On friendly index sets of 2-regular graphs

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)