A characterization of semitwin digraphs

DOI10.1007/S40590-026-00939-5MaRDI QIDQ7323810zbMATH OpenFDO

Authors Ofelia Cepeda-Camargo, Hortensia Galeana-Sánchez

Publication date 2 September 2026

Published in Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S40590-026-00939-5

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• A conjecture on cycle-pancyclism in tournaments
• Characterization of oriented graphs of rank 2
• Cycle-pancyclism in tournaments. I
• Cycle-pancyclism in tournaments. II
• Cycle-pancyclism in tournaments. III
• Domination and location in twin-free digraphs
• scientific article; zbMATH DE number 6515825 (Why is no real title available?)
• Minimum self-repairing graphs
• On the characterization of digraphs with given rank
• Structural properties of twin-free graphs
• The strong metric dimension of graphs and digraphs

This page was built for publication: A characterization of semitwin digraphs

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