The antistrong property for special digraph families

DOI10.1007/S00373-021-02375-WMaRDI QIDQ2053713zbMATH OpenOpenAlexFDO

Authors Eminjan Sabir, Li-Li Yuan, Jixiang Meng

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

antistrongCartesian productlexicographic producttournament

Mathematics Subject Classification ID

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

Recommendations

• Antistrong digraphs
• Ore conditions for antistrong digraphs
• Residual properties of reflexive, anti-symmetric digraphs
• A property of spectra of digraphs
• Antimagicness of some families of generalized graphs
• Anti-Eulerian digraphs
• On graphs with strong anti-reciprocal eigenvalue property
• Antimagicness for a family of generalized antiprism graphs
• Antipodal graphs and digraphs
• On digraphs with the odd cycle property

Cites work

• An efficient method for decomposition of regular structures using graph products
• Antidirected Hamiltonian paths in tournaments
• Antistrong digraphs
• Coloring graph products---a survey
• Connectivity of Cartesian products of graphs
• Digraphs
• Handbook of product graphs
• scientific article; zbMATH DE number 1092941 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• On connectivity of the cartesian product of two graphs
• Optimal analysis of structures by concepts of symmetry and regularity
• Quasi-independence, homology and the unity of type: a topological theory of characters
• The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable

Cited in

(6)

• Anti-Eulerian digraphs
• Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian
• Antistrong digraphs
• A property of most of the known non-reconstructible digraphs
• Ore conditions for antistrong digraphs
• Classical conditions for (weakly-)antistrong digraphs

Describes a project that uses

Uses Software

• TopoLayout

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053713)