NEPS operations on cordial graphs (Q1801699)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NEPS operations on cordial graphs |
scientific article; zbMATH DE number 205601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NEPS operations on cordial graphs |
scientific article; zbMATH DE number 205601 |
Statements
NEPS operations on cordial graphs (English)
0 references
20 June 1993
0 references
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.
0 references
non-complete extended \(p\)-sum
0 references
partition
0 references
adjacency matrix
0 references
characterization
0 references
cordial graphs
0 references
0.783938467502594
0 references
0.7693010568618774
0 references
0.7669832110404968
0 references
0.7607797980308533
0 references
