Boundary vertices of Cartesian product of directed graphs (Q1738686): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4539516 / 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: Rebuilding convex sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On geodetic sets formed by boundary vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary vertices in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectedness of Products of Two Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Directed Geodetic Structure of a Strong Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph multiplication / rank
 
Normal rank

Revision as of 00:10, 19 July 2024

scientific article
Language Label Description Also known as
English
Boundary vertices of Cartesian product of directed graphs
scientific article

    Statements

    Identifiers