On the exponent set of primitive locally semicomplete digraphs (Q1370296): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s11766-997-0028-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W82936618 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Locally semicomplete digraphs: A generalization of tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the structure of locally semicomplete digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the exponent set of primitive locally semicomplete digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4848183 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the powers of tournament matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the exponent of a primitive digraph / rank | |||
Normal rank |
Latest revision as of 19:34, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the exponent set of primitive locally semicomplete digraphs |
scientific article |
Statements
On the exponent set of primitive locally semicomplete digraphs (English)
0 references
8 April 1998
0 references
Locally semicomplete digraphs were introduced by \textit{J. Bang-Jensen} [J. Graph Theory 14, No. 3, 371-390 (1990; Zbl 0703.05026)] as a generalization of tournaments and semicomplete digraphs. A digraph is called primitive if there exists a positive integer \(k\) such that for all ordered pairs \(u, v\) there is a walk from \(u\) to \(v\) of length \(k\). The exponent from \(u\) to \(v\) is the least integer \(\gamma\) such that there exists a walk from \(u\) to \(v\) of length \(m\) for all \(m\geq\gamma\). In this paper properties of cycles of primitive locally semicomplete digraphs are presented and the exponent sets are determined.
0 references
locally semicomplete digraph
0 references
exponent set
0 references