On graphs whose graphoidal domination number is one (Q321997): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1772202
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Belmannu Devadas Acharya / 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.akcej.2015.11.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2209991604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphoidal covers and graphoidal covering number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results on domination in graphoidally covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in graphoidal covers of a graph / rank
 
Normal rank

Revision as of 17:20, 12 July 2024

scientific article
Language Label Description Also known as
English
On graphs whose graphoidal domination number is one
scientific article

    Statements

    On graphs whose graphoidal domination number is one (English)
    0 references
    0 references
    0 references
    14 October 2016
    0 references
    graphoidal cover
    0 references
    graphoidally covered graph
    0 references
    \(\psi\)-domination
    0 references

    Identifiers