Strong edge geodetic problem in networks (Q2409583): 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.1515/math-2017-0101 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2761247186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geodetic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The restrained geodetic number of a graph / 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: On the geodetic number of a 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: Geodetic sets and Steiner sets 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: The edge geodetic number and Cartesian product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-edge geodetic number and graph operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5443196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isometric path numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2881283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-paintability of generalized theta-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential algorithmic speedup by a quantum walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable networks and product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical study of quantum walk through glued-tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Glued trees algorithm under phase damping / rank
 
Normal rank

Latest revision as of 13:45, 14 July 2024

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

    Statements

    Strong edge geodetic problem in networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 October 2017
    0 references
    geodetic problem
    0 references
    strong edge geodetic problem
    0 references
    computational complexity
    0 references
    transport networks
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references