Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (Q1637098): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q130137902, #quickstatements; #temporary_batch_1728330469310
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963193175 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1708.02416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with large geodetic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic Number versus Hull Number in $P_3$-Convexity / 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: 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: Q4949797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geodetic contraction games on graphs / 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 geodetic problem in grid-like architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geodetic numbers of graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong geodetic problem in networks / 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: Edge geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3092149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of geodesic graphs and the geodetic number of products / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130137902 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:51, 7 October 2024

scientific article
Language Label Description Also known as
English
Strong geodetic number of complete bipartite graphs and of graphs with specified diameter
scientific article

    Statements

    Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (English)
    0 references
    0 references
    7 June 2018
    0 references
    geodetic number
    0 references
    strong geodetic number
    0 references
    isometric path number
    0 references
    complete bipartite graphs
    0 references
    diameter
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references