Cordial labeling of \(mK_ n\) (Q1357726): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4733887 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5629680 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4724671 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3199455 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5752611 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3360909 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3693570 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3825114 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3203050 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The cordiality of one-point union of \(n\) copies of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A-cordial graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3358767 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3976625 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NEPS operations on cordial graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4020464 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4000783 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3358766 / rank | |||
Normal rank |
Revision as of 16:41, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cordial labeling of \(mK_ n\) |
scientific article |
Statements
Cordial labeling of \(mK_ n\) (English)
0 references
20 October 1997
0 references
cordial labeling
0 references
graceful labeling
0 references
diophantine equation
0 references
vertex labeling
0 references
edge labeling
0 references