The antistrong property for special digraph families

DOI10.1007/s00373-021-02375-wzbMath1479.05133OpenAlexW3185115634MaRDI QIDQ2053713

Eminjan Sabir, Ji Xiang Meng, Li-Li Yuan

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02375-w

zbMATH Keywords

tournamentCartesian productlexicographic productantistrong

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Ore conditions for antistrong digraphs ⋮ Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian

Uses Software

• TopoLayout

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Antistrong digraphs
• Connectivity of Cartesian products of graphs
• The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
• On connectivity of the cartesian product of two graphs
• Coloring graph products---a survey
• Quasi-independence, homology and the unity of type: a topological theory of characters
• Optimal Analysis of Structures by Concepts of Symmetry and Regularity
• Digraphs
• An efficient method for decomposition of regular structures using graph products
• Antidirected Hamiltonian paths in tournaments

This page was built for publication: The antistrong property for special digraph families