Competition Graphs of Strongly Connected and Hamiltonian Digraphs

DOI10.1137/S0895480191197234zbMATH Open0830.05035OpenAlexW1992973233MaRDI QIDQ4837645FDOQ4837645

Authors: Kathryn Fraughnaugh, J. Richard Lundgren, S. K. Merz, John S. Maybee, Norman J. Pullman 

Publication date: 18 January 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480191197234

Recommendations

• Competition Graphs of Hamiltonian Digraphs
• scientific article; zbMATH DE number 3912431
• The Hamiltonicity on the competition graphs of round digraphs
• scientific article; zbMATH DE number 1409238
• scientific article; zbMATH DE number 5914965

zbMATH Keywords

communication networkcompetition graphcycledigraphinterval graphchordal graphconflict graphstrongly connected digraphsedge clique coverHamiltonian digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Structural characterization of families of graphs (05C75) Communication networks in operations research (90B18)

Cited In (12)

• The competition-common enemy graphs of digraphs satisfying Conditions $C(p)$ and $C'(p)$
• On CCE graphs of doubly partial orders
• The \(m\)-step competition graphs of doubly partial orders
• The competition hypergraphs of doubly partial orders
• A class of acyclic digraphs with interval competition graphs
• Title not available (Why is that?)
• Competition hypergraphs of products of digraphs
• Title not available (Why is that?)
• Structural properties and hamiltonicity of neighborhood graphs
• Competition Graphs of Hamiltonian Digraphs
• The Hamiltonicity on the competition graphs of round digraphs
• Title not available (Why is that?)

This page was built for publication: Competition Graphs of Strongly Connected and Hamiltonian Digraphs

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