On the \(L(2,1)\)-labelings of amalgamations of graphs (Q1949093): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Nathaniel J. Karst / rank
Normal rank
 
Property / author
 
Property / author: Nathaniel J. Karst / rank
 
Normal rank
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.1016/j.dam.2012.11.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W98206581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling the vertex amalgamation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Products of Complete Graphs with a Condition at Distance Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating path coverings to vertex labellings with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(L(p,1)\)-labelling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Griggs and Yeh's Conjecture and $L(p,1)$-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(2,1)\)-labelings of Cartesian products of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On felicitous graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labelings of Cartesian products of two cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:13, 6 July 2024

scientific article
Language Label Description Also known as
English
On the \(L(2,1)\)-labelings of amalgamations of graphs
scientific article

    Statements

    On the \(L(2,1)\)-labelings of amalgamations of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(L(2,1)\)-labeling
    0 references
    \(L(2,1)\)-coloring
    0 references
    distance two labeling
    0 references
    amalgamation
    0 references
    Cartesian product
    0 references
    0 references