Efficient domination in circulant graphs with two chord lengths (Q846022): 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: Joseph G. Peters / rank
Normal rank
 
Property / author
 
Property / author: Joseph G. Peters / 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.ipl.2007.02.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995459940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decomposition of Cayley graphs of degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient dominating sets in Cayley graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent perfect domination sets in Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point-symmetric graphs with a prime number of points / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:00, 2 July 2024

scientific article
Language Label Description Also known as
English
Efficient domination in circulant graphs with two chord lengths
scientific article

    Statements

    Efficient domination in circulant graphs with two chord lengths (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    circulant graph
    0 references
    efficient domination
    0 references
    combinatorial problems
    0 references
    0 references