X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (14) 14
mathematics, applied (13) 13
algorithms (10) 10
graphs (10) 10
computer science (7) 7
split graph (7) 7
computer science, software engineering (6) 6
algorithm (5) 5
digraphs (5) 5
discrete mathematics (5) 5
graph theory (5) 5
operations research & management science (5) 5
combinatorics (4) 4
complexity (4) 4
inversions (4) 4
mathematics - combinatorics (4) 4
permutations (4) 4
random trees (4) 4
split graphs (4) 4
split trees (4) 4
split-stars (4) 4
theory of computation (4) 4
algorithm analysis and problem complexity (3) 3
alternating group graphs (3) 3
approximation algorithm (3) 3
computer science - data structures and algorithms (3) 3
computer science - discrete mathematics (3) 3
computer science, hardware & architecture (3) 3
computer systems organization and communication networks (3) 3
cumulants (3) 3
data structures, cryptology and information theory (3) 3
discrete mathematics and combinatorics (3) 3
mathematical analysis (3) 3
mathematics of computing (3) 3
networks (3) 3
split decomposition (3) 3
split digraph (3) 3
statistics & probability (3) 3
[info.info-dm]computer science [cs]/discrete mathematics [cs.dm] (2) 2
acyclic digraph (2) 2
acyclic digraphs (2) 2
algebraic geometry (2) 2
approximation (2) 2
apx-hardness (2) 2
associative rings and algebras (2) 2
associative rings and algebras -- representation theory of rings and algebras -- auslander-reiten sequences and auslander-reiten quivers (2) 2
auslander-reiten sequences and auslander-reiten quivers (2) 2
branch-and-price (2) 2
branching (2) 2
chain partition (2) 2
clique-width (2) 2
combinatorial analysis (2) 2
computation (2) 2
computer science, theory & methods (2) 2
connectivity (2) 2
cycles (2) 2
decomposition (2) 2
deletion (2) 2
dilworth's theorem (2) 2
directed graph (2) 2
directed graphs (2) 2
graphs, representations of (2) 2
hypercubes (2) 2
integers (2) 2
matematik (2) 2
mathematical models (2) 2
min-max theorem (2) 2
minimum conflict-free row split problem (2) 2
natural sciences (2) 2
naturvetenskap (2) 2
oriented graphs (2) 2
parameterized complexity (2) 2
path partition (2) 2
perfect phylogeny (2) 2
planar graphs (2) 2
polynomials (2) 2
rank-width (2) 2
recognition (2) 2
representation theory of rings and algebras (2) 2
representations of graphs (2) 2
theorem (2) 2
theoretical computer science (2) 2
tree (2) 2
trees (2) 2
variable neighborhood search (2) 2
vehicle-routing problem (2) 2
-split graph (1) 1
03e05 (1) 1
04a03 (1) 1
05c05 (1) 1
05c63 (1) 1
05c99 (1) 1
519.17 [udc] (1) 1
81 [udc] (1) 1
91b10 (1) 1
92b99 (1) 1
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (1) 1
[formula omitted]-partial coloring (1) 1
a4-structure (1) 1
a4‐structure (1) 1
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Mathematics, ISSN 0012-365X, 04/2012, Volume 312, Issue 7, pp. 1314 - 1325
We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree... 
Split graph | Directed graph | Degree sequence | GRAPH | MATHEMATICS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2017, Volume 216, pp. 609 - 617
We introduce new versions of chordal and split digraphs, and explore their similarity with the corresponding undirected notions. 
Split digraph | Chordal digraph | Perfect digraph | Recognition algorithm | MATHEMATICS, APPLIED | RECOGNIZING INTERVAL-GRAPHS | RECOGNITION | ACYCLIC DIGRAPHS | TIME | ALGORITHMS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 05/2017, Volume 340, Issue 5, pp. 851 - 854
A path partition P of a digraph D is a set of disjoint paths which covers V(D). Let k be a positive integer. The k-norm of a path partition P of a digraph is... 
Split digraph | Path partition | Linial's conjecture | k-partial coloring | MATHEMATICS | THEOREM | PATH PARTITION CONJECTURE | PROOF
Journal Article
Applicable Analysis and Discrete Mathematics, ISSN 1452-8630, 4/2019, Volume 13, Issue 1, pp. 224 - 239
Fault tolerance is especially important for interconnection networks, since the growing size of networks increases their vulnerability to component failures. A... 
Integers | Sufficient conditions | Fault tolerance | Toughness | Mathematical theorems | Real numbers | Discrete mathematics | Kronecker product | Vertices | RANDIC INDEX | MATHEMATICS | digraphs | MATHEMATICS, APPLIED | k-multisplit graphs | Maximally edge-connected | SPLIT GRAPHS | super-edge-connected | the zeroth-order general Randic index | EDGE VULNERABILITY PARAMETERS
Journal Article
ACM Transactions on Algorithms (TALG), ISSN 1549-6325, 06/2018, Volume 14, Issue 2, pp. 1 - 26
Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurović et al. (IEEE TCBB, 2018) introduced... 
min-max theorem | minimum conflict-free row split problem | Perfect phylogeny | approximation algorithm | chain partition | APX-hardness | branching | acyclic digraph | Dilworth's theorem | Branching | Acyclic digraph | Minimum conflict-free row split problem | Approximation algorithm | Min-max theorem | Chain partition
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 10/2018, Volume 247, pp. 122 - 126
P. Hell and C. Hernández-Cruz recently defined new directed graph analogs of the traditional concepts of chordal and split graphs. This paper will provide... 
Chordal graph | Split graph | Clique tree | Strict split digraph | Strict chordal digraph | MATHEMATICS, APPLIED
Journal Article
Discrete Mathematics, ISSN 0012-365X, 05/2017, Volume 340, Issue 5, pp. 851 - 854
A path partition P of a digraph D is a set of disjoint paths which covers V(D). Let k be a positive integer. The k-norm of a path partition P of a digraph is... 
Split digraph | Path partition | [formula omitted]-partial coloring | Linial’s conjecture
Journal Article
Linear Algebra and Its Applications, ISSN 0024-3795, 2006, Volume 414, Issue 1, pp. 138 - 171
Journal Article
ALGORITHMICA, ISSN 0178-4617, 03/2020, Volume 82, Issue 3, pp. 589 - 615
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a... 
COMPUTER SCIENCE, SOFTWARE ENGINEERING | Permutations | MATHEMATICS, APPLIED | Inversions | Split trees | Random trees | Cumulants
Journal Article
ACM TRANSACTIONS ON ALGORITHMS, ISSN 1549-6325, 06/2018, Volume 14, Issue 2
Motivated by applications in cancer genomics and following the work of Hajirasouliha and Raphael (WABI 2014), Hujdurovic et al. (IEEE TCBB, 2018) introduced... 
MATHEMATICS, APPLIED | BIPARTITE | min-max theorem | minimum conflict-free row split problem | APPROXIMATION | Perfect phylogeny | chain partition | APX-hardness | ALGORITHMS | branching | Dilworth's theorem | GRAPHS | TREES | COMPLEXITY | approximation algorithm | COMPUTER SCIENCE, THEORY & METHODS | acyclic digraph
Journal Article
2020, Volume 82, Issue 3
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a... 
Permutations | Naturvetenskap | Inversions | Split trees | Mathematics | Natural Sciences | Matematik | Random trees | Cumulants
Publication
2020, Volume 82, Issue 3
We investigate the number of permutations that occur in random labellings of trees. This is a generalisation of the number of subpermutations occurring in a... 
Data- och informationsvetenskap | Permutations | Inversions | Split trees | Mathematics | Computer and Information Sciences | Random trees | Naturvetenskap | Computer Sciences | Datavetenskap (datalogi) | Natural Sciences | Matematik | Sannolikhetsteori och statistik | Cumulants | Probability Theory and Statistics
Publication
Ars Combinatoria, ISSN 0381-7032, 01/2010, Volume 94, pp. 25 - 32
The super (resp., edge-) connectivity of a connected graph is the minimum cardinality of a vertex-cut (resp., an edge-cut) whose removal does not isolate a... 
Möbius cubes | Super connectivity | Locally twisted cubes | Connectivity | Hypercubes | Restricted connectivity | Cross cubes | Twisted cubes | SPLIT-STARS | restricted connectivity | SUPERCONNECTIVITY | Mobius cubes | super connectivity | hypercubes | DIGRAPHS | CONDITIONAL EDGE-CONNECTIVITY | twisted cubes | MATHEMATICS | cross cubes | locally twisted cubes | ALTERNATING GROUP GRAPHS
Journal Article
by Wang, J and Xu, XR and Gao, LQ and Zhu, DJ and Yang, YS
UTILITAS MATHEMATICA, ISSN 0315-3681, 06/2017, Volume 103, pp. 237 - 243
The feedback number of a graph G is the minimum number of vertices whose removal from G results in an acyclic subgraph. Use f (AG(n)) to denote the feedback... 
feedback vertex set | SPLIT-STARS | MATHEMATICS, APPLIED | NUMBERS | alternating group graphs | STATISTICS & PROBABILITY | cycles | acyclic subgraph | DIGRAPHS | feedback number
Journal Article
Computational Statistics and Data Analysis, ISSN 0167-9473, 2006, Volume 50, Issue 3, pp. 611 - 641
Journal Article
2009 Asia-Pacific Conference on Information Processing, 07/2009, Volume 1, pp. 285 - 287
Diameter of an undirected graph is the maximal distance between any two vertices. We can obtain a digraph (directed graph) by presenting a direction for each... 
orientation | Bipartite graph | diameter | digraph | split graph | Information processing | Split graph | Digraph | Orientation | Diameter
Conference Proceeding
2016, Graduate studies in mathematics, ISBN 9781470423070, Volume 174, xii, 295 pages
Book
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 01/2013, Volume 103, Issue 1, pp. 184 - 208
The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement... 
Split graph | Circuit partition | Pivoting | Isotropic system | Interlace polynomial | Local complementation | NUMBER | WALKS | DECOMPOSITION | LINKS | FORMULA | CIRCLE | CIRCUITS | MATHEMATICS | LINEAR ALGEBRA | EULER TRAILS | GRAPH POLYNOMIALS
Journal Article
No results were found for your search.

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