X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (15) 15
group theory and generalizations (9) 9
graph theory (8) 8
combinatorics (7) 7
computer science, general (5) 5
convex and discrete geometry (5) 5
discrete mathematics and combinatorics (5) 5
generalization of tournaments (5) 5
mathematics - combinatorics (5) 5
order, lattices, ordered algebraic structures (5) 5
algebra (4) 4
analysis (4) 4
applications of mathematics (4) 4
mathematical analysis (4) 4
mathematics, general (4) 4
theoretical computer science (4) 4
theoretical, mathematical and computational physics (4) 4
tournaments (4) 4
graphs (3) 3
hamiltonian cycles (3) 3
research (3) 3
arc-local tournament (2) 2
arc-locally semicomplete digraph (2) 2
bipartite tournaments (2) 2
computer science (2) 2
cycle factors (2) 2
decomposition (2) 2
directed graph (2) 2
discrete mathematics (2) 2
kernels (2) 2
mathematical research (2) 2
qa mathematics (2) 2
05c20 (1) 1
05c50 (1) 1
05c69 (1) 1
05e30 (1) 1
14m15 (1) 1
15b34 (1) 1
3-anti-quasi-transitive digraph (1) 1
3-quasi-transitive digraph (1) 1
3-quasi-transitive digraphs (1) 1
51m20 (1) 1
52c17 (1) 1
94b60 (1) 1
algebra and number theory (1) 1
algebras (1) 1
algorithms (1) 1
approximate (1) 1
approximation theory (1) 1
arc-locally in-semicomplete digraph (1) 1
arc-locally semicomplete digraphs (1) 1
asymmetry (1) 1
banking industry (1) 1
chaotic dynamics (1) 1
chordal distance (1) 1
cki-digraph (1) 1
classification (1) 1
collection (1) 1
complete intersections (1) 1
covering (1) 1
credit reports (1) 1
cut (1) 1
cycles (1) 1
digraphs (1) 1
eigen values (1) 1
eigenvalues (1) 1
electric generators (1) 1
engineering design (1) 1
expanders (1) 1
forbidden induced subgraphs (1) 1
functional analysis (1) 1
generalization of bipartite tournaments (1) 1
generalization of tournament (1) 1
generalized quadrangle (1) 1
generalized sum of digraphs (1) 1
generating functions (1) 1
grassmannian packings (1) 1
group theory (1) 1
hadamard matrices (1) 1
hamiltonian digraphs (1) 1
hard (1) 1
high energy physics (1) 1
idempotents (1) 1
images (1) 1
inapproximability (1) 1
independent set (1) 1
independent set of vertices (1) 1
invariance (1) 1
kernel (1) 1
lattice (1) 1
locally semicomplete digraphs (1) 1
longest path (1) 1
management science (1) 1
matematik (1) 1
mathematics - group theory (1) 1
mathematics - probability (1) 1
matrices (1) 1
max-cut (1) 1
might (1) 1
noise stability (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Graphs and Combinatorics, ISSN 0911-0119, 5/2019, Volume 35, Issue 3, pp. 669 - 675
Kernel is an important topic in digraphs. A digraph such that every proper induced subdigraph has a kernel is said to be critical kernel imperfect (CKI, for... 
Arc-locally in-semicomplete digraph | 05C20 | Generalization of bipartite tournaments | CKI-digraph | Mathematics | Engineering Design | Combinatorics | 3-Anti-quasi-transitive digraph | 05C69 | Kernel | 3-Quasi-transitive digraph | MATHEMATICS | Kernels | Asymmetry | Graph theory
Journal Article
Discrete Mathematics, ISSN 0012-365X, 02/2014, Volume 315-316, Issue 1, pp. 135 - 143
In 2004, Bang-Jensen introduced Hi-free digraphs, for i in {1,2,3,4}, as a generalization of semicomplete and semicomplete bipartite digraphs. Bang-Jensen... 
Hamiltonian cycles | Cycle factors | Bipartite tournaments | Spanning 1-diregular subdigraphs | Generalization of tournaments | MATHEMATICS | PATHS | Collection | Covering | Graph theory | Mathematical analysis
Journal Article
Discrete Mathematics, ISSN 0012-365X, 06/2016, Volume 339, Issue 6, pp. 1763 - 1770
Let D1,…,Dk be a family of pairwise vertex-disjoint digraphs. The generalized sum of D1,…,Dk, denoted by D1⊕⋯⊕Dk, is the set of all digraphs D which satisfies:... 
Hamiltonian cycles | Cycle factors | Generalized sum of digraphs | Bipartite tournaments | Generalization of tournaments | Mathematical analysis | Graph theory | Images
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2010, Volume 310, Issue 19, pp. 2495 - 2498
In this paper, D = ( V ( D ) , A ( D ) ) denotes a loopless directed graph (digraph) with at most one arc from u to v for every pair of vertices u and v of V (... 
Arc-locally semicomplete digraphs | Hamiltonian digraphs | 3-quasi-transitive digraphs | Generalization of tournaments | MATHEMATICS | Mathematical analysis | Graphs
Journal Article
Discrete Mathematics, ISSN 0012-365X, 06/2012, Volume 312, Issue 11, pp. 1883 - 1891
Arc-locally semicomplete digraphs were introduced by Bang-Jensen as a common generalization of both semicomplete and semicomplete bipartite digraphs in 1993.... 
Arc-locally semicomplete digraph | Directed graph | Arc-local tournament | Generalization of tournaments | Independent set of vertices | MATHEMATICS | TOURNAMENTS | Mathematical analysis | Graph theory | Classification
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2008, Volume 308, Issue 12, pp. 2460 - 2472
We study different classes of digraphs, which are generalizations of tournaments, to have the property of possessing a maximal independent set intersecting... 
Non-augmentable path | Longest path | Generalization of tournament | Independent set | MATHEMATICS | generalization of tournament | longest path | non-augmentable path | LOCALLY SEMICOMPLETE DIGRAPHS | independent set | KERNELS
Journal Article
Israel Journal of Mathematics, ISSN 0021-2172, 10/2017, Volume 222, Issue 1, pp. 91 - 108
A Hamilton cycle in a graph Γ is a cycle passing through every vertex of Γ. A Hamiltonian decomposition of Γ is a partition of its edge set into disjoint... 
Algebra | Analysis | Theoretical, Mathematical and Computational Physics | Mathematics, general | Mathematics | Group Theory and Generalizations | Applications of Mathematics | MATHEMATICS | EXPANDERS | TOURNAMENTS | CYCLES | Graph theory | Research | Mathematical research | Decomposition (Mathematics)
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2004, Volume 283, Issue 1, pp. 1 - 6
Arc-locally semicomplete digraphs were introduced in (Preprint, No. 10, 1993, Department of Mathematics and Computer Science, University of Southern Denmark)... 
Strong connectivity | Hamiltonian cycles | Arc-local tournament | Generalization of tournaments | Arc-locally semicomplete digraph | Path and cycles | Directed graph | arc-local tournament | strong connectivity | MATHEMATICS | arc-locally semicomplete digraph | TOURNAMENTS | directed graph | path and cycles | generalization of tournaments
Journal Article
Israel Journal of Mathematics, ISSN 0021-2172, 3/2017, Volume 217, Issue 1, pp. 477 - 505
We consider the following Turán-type problem: given a fixed tournament H, what is the least integer t = t(n,H) so that adding t edges to any n-vertex... 
Algebra | Analysis | Theoretical, Mathematical and Computational Physics | Mathematics, general | Mathematics | Group Theory and Generalizations | Applications of Mathematics | MATHEMATICS | STRUCTURE THEOREM | GRAPHS | Tournaments | Usage | Matrices | Graph theory
Journal Article
Israel Journal of Mathematics, ISSN 0021-2172, 2/2015, Volume 205, Issue 1, pp. 73 - 108
Geometric grid classes and the substitution decomposition have both been shown to be fundamental in the understanding of the structure of permutation classes.... 
Algebra | Analysis | Theoretical, Mathematical and Computational Physics | Mathematics, general | Mathematics | Group Theory and Generalizations | Applications of Mathematics | MATHEMATICS | SETS | Permutations | Research | Mathematical research | Generating functions | Decomposition (Mathematics)
Journal Article
Journal of Algebraic Combinatorics, ISSN 0925-9899, 2/2017, Volume 45, Issue 1, pp. 149 - 170
Given a simple digraph D on n vertices (with $$n\ge 2$$ n ≥ 2 ), there is a natural construction of a semigroup of transformations $$\langle D\rangle $$ ⟨ D ⟩... 
Transformation semigroup | Convex and Discrete Geometry | Word length | Mathematics | Order, Lattices, Ordered Algebraic Structures | Group Theory and Generalizations | Combinatorics | Computer Science, general | Simple digraph | MATHEMATICS | IDEMPOTENTS | Rankings | Electric generators
Journal Article
Journal of Algebraic Combinatorics, ISSN 0925-9899, 11/2013, Volume 38, Issue 3, pp. 721 - 744
Let G=(V,E) be a finite, simple graph. We consider for each oriented graph $G_{\mathcal{O}}$ associated to an orientation ${\mathcal{O}}$ of the edges of G,... 
Convex and Discrete Geometry | Mathematics | Order, Lattices, Ordered Algebraic Structures | Group Theory and Generalizations | Combinatorics | Computer Science, general | Oriented graphs | Complete intersections | Forbidden induced subgraphs | Toric ideals | MATHEMATICS | ALGEBRAS
Journal Article
Journal of Algebraic Combinatorics, ISSN 0925-9899, 5/2015, Volume 41, Issue 3, pp. 817 - 842
The $$t$$ t -vertex condition, for an integer $$t\ge 2$$ t ≥ 2 , was introduced by Hestenes and Higman (SIAM Am Math Soc Proc 4:41–160, 1971) providing a... 
Generalized quadrangle | Convex and Discrete Geometry | Mathematics | Order, Lattices, Ordered Algebraic Structures | Group Theory and Generalizations | Combinatorics | Computer Science, general | Strongly regular graph | t -vertex condition
Journal Article
Journal of Algebraic Combinatorics, ISSN 0925-9899, 06/2018, Volume 47, Issue 4, pp. 623 - 639
We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly ℓ -walk-regular with ℓ>1 if the number of walks of length ℓ... 
Walk | Eigenvalues | Strongly regular digraph | Spectrum | 05E30 | 05C50 | Convex and Discrete Geometry | Mathematics | Order, Lattices, Ordered Algebraic Structures | Group Theory and Generalizations | Combinatorics | Computer Science, general | MATHEMATICS | DIGRAPHS | Management science | Mathematics - Combinatorics
Journal Article
Journal of Algebraic Combinatorics, ISSN 0925-9899, 2/2017, Volume 45, Issue 1, pp. 129 - 148
A construction based on a $$4l \times 4l$$ 4 l × 4 l Hadamard matrix leads to a new family of optimal orthoplex packings in Grassmannian spaces $$G_{\mathbb... 
Hadamard matrices | Space-time codes | 14M15 | Mathematics | Primary 51F25 | 51M20 | 52C17 | Optimal packings | 15B34 | Chordal distance | Convex and Discrete Geometry | Secondary 15A30 | Order, Lattices, Ordered Algebraic Structures | Group Theory and Generalizations | 94B60 | Rankin bound | Combinatorics | Computer Science, general | Grassmannian packings | MATHEMATICS
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.