Exponent-critical primitive graphs and the Kronecker product
A directed graph is primitive of exponent <em>t</em> if it contains walks of length <em>t</em> between all pairs of vertices, and <em>t</em> is minimal with this property. Moreover, it is exponent-critical if the deletion of any arc results in an imprimitive graph...
Main Authors: | Olga O'Mahony, Rachel Quinlan |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2019-10-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/623 |
Similar Items
-
The minimum exponent of the primitive digraphs on the given number of arcs
by: Jolanta Rosiak
Published: (2004-01-01) -
Generalization of MacNeish’s Kronecker product theorem of mutually orthogonal Latin squares
by: A. El-Mesady, et al.
Published: (2021-05-01) -
Analysis Algorithms of Primitiveness of the Directed Graphs
by: S.N. Kyazhin, et al.
Published: (2012-03-01) -
The construction of all nonisomorphic minimum vertex extensions of the graph by the method of canonical representatives
by: Abrosimov, Mihail Borisovich, et al.
Published: (2021-05-01) -
On Edge-Primitive Graphs of Order as a Product of Two Distinct Primes
by: Renbing Xiao, et al.
Published: (2023-09-01)