A new approach in finding full friendly indices (Q1695616): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s40840-016-0373-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2341407835 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4724671 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniformly cordial graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A-cordial graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3620521 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2935632 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2933529 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Full friendly index sets of \(P_2 \times P_n\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2869652 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Full friendly index sets of Cartesian products of two cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3166105 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2870815 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Full friendly index set. I / rank | |||
Normal rank |
Revision as of 02:01, 15 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new approach in finding full friendly indices |
scientific article |
Statements
A new approach in finding full friendly indices (English)
0 references
7 February 2018
0 references
vertex labeling
0 references
friendly labeling
0 references
full friendly index set
0 references
full vertices blow-up
0 references
embedding labeling graph method
0 references