Boundary-type sets of strong product of directed graphs

DOI10.26493/1855-3974.2229.5f1zbMath1485.05040OpenAlexW3138829507MaRDI QIDQ3390054

G. Narasimha-Shenoi Prasanth, Bijo S. Anand, Mary Shalet Thottungal Joseph, Manoj Changat

Publication date: 24 March 2022

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.2229.5f1

zbMATH Keywords

strong productstrongly connected digraphmaximum distanceboundary-type sets

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• On the Cartesian skeleton and the factorization of the strong product of digraphs
• On geodetic sets formed by boundary vertices
• Distance in digraphs
• Boundary vertices of Cartesian product of directed graphs
• Boundary vertices in graphs
• Rebuilding convex sets in graphs
• Digraphs Products
• Classes of Directed Graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: Boundary-type sets of strong product of directed graphs