Distance magic labeling and two products of graphs (Q497299): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Aleksandra Tepeh Horvat / rank
Normal rank
 
Property / author
 
Property / author: Aleksandra Tepeh Horvat / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59408368 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051761578 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1210.1836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\Sigma\) and \(\Sigma'\) labelled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on group distance magic graphs \(G[C_4]\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance magic circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3410855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3532230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kronecker Product of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A worthy family of semisymmetric graphs / rank
 
Normal rank

Latest revision as of 19:07, 10 July 2024

scientific article
Language Label Description Also known as
English
Distance magic labeling and two products of graphs
scientific article

    Statements

    Distance magic labeling and two products of graphs (English)
    0 references
    0 references
    0 references
    0 references
    24 September 2015
    0 references
    distance magic graphs
    0 references
    direct product
    0 references
    lexicographic product
    0 references

    Identifiers