Boundary vertices of Cartesian product of directed graphs

DOI10.1007/s40819-019-0604-4zbMath1411.05101OpenAlexW2909672245WikidataQ128609063 ScholiaQ128609063MaRDI QIDQ1738686

Xianqiang Yang

Publication date: 18 April 2019

Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40819-019-0604-4

zbMATH Keywords

contoureccentricityboundaryperipherymaximum distancetwo sided eccentricity property

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Lexicographic product of digraphs and related boundary-type sets ⋮ Unnamed Item ⋮ Boundary-type sets of strong product of directed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graph multiplication
• On geodetic sets formed by boundary vertices
• On the geodetic number and related metric sets in Cartesian product graphs
• Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
• Distance in digraphs
• Boundary vertices in graphs
• Rebuilding convex sets in graphs
• The Directed Geodetic Structure of a Strong Digraph
• A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product
• Connectedness of Products of Two Directed Graphs
• Networks

This page was built for publication: Boundary vertices of Cartesian product of directed graphs