Strong geodetic number of graphs and connectivity (Q1988559): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A survey of Nordhaus-Gaddum type relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block decomposition approach to compute a minimum geodetic set / 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: Q2747184 / 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: The geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge geodetic problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isometric path numbers of graphs / 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

Latest revision as of 12:36, 22 July 2024

scientific article
Language Label Description Also known as
English
Strong geodetic number of graphs and connectivity
scientific article

    Statements

    Strong geodetic number of graphs and connectivity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 April 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    cover
    0 references
    strong geodetic number
    0 references
    0 references