On the geodetic number of complementary prisms (Q1721934): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2018.12.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2883134411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local majorities, coalitions and monopolies in graphs: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geodetic hull number of \(P_{k}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Geodetic Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5441572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing some complementary products / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank

Latest revision as of 04:05, 18 July 2024

scientific article
Language Label Description Also known as
English
On the geodetic number of complementary prisms
scientific article

    Statements

    On the geodetic number of complementary prisms (English)
    0 references
    0 references
    0 references
    0 references
    13 February 2019
    0 references
    geodetic convexity
    0 references
    geodetic number
    0 references
    complementary prism
    0 references
    computational complexity
    0 references
    combinatorial problems
    0 references

    Identifiers