Strong geodetic problem in networks (Q2282484): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computational Complexity of Geodetic Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4163554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geodetic number and related metric sets in Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic spectra of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic sets in graphs / 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: The geodetic number of an oriented graph / 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: Computing Minimum Geodetic Sets of Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Sierpiński graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hull number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientable convexity, geodetic and hull numbers in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2853448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pitfalls in computing the geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tower of Hanoi – Myths and Maths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and classification of Sierpiński-type graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the geodetic and geodetic domination numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Steiner, geodetic and hull numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hull and geodetic numbers of orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong geodetic number of complete bipartite graphs and of graphs with specified diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs S(n, k) and a Variant of the Tower of Hanoi Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutte polynomial of the Apollonian network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge geodetic problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodesic Convexity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of geodesic graphs and the geodetic number of products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic sets and Steiner sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of labeled geodetic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lower and upper forcing geodetic numbers of block--cactus graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of spanning trees on Apollonian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of spanning trees in Apollonian networks / rank
 
Normal rank

Revision as of 10:01, 21 July 2024

scientific article
Language Label Description Also known as
English
Strong geodetic problem in networks
scientific article

    Statements

    Strong geodetic problem in networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 January 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    geodetic problem
    0 references
    strong geodetic problem
    0 references
    Apollonian networks
    0 references
    Sierpiński graphs
    0 references
    computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references