X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (3397) 3397
Conference Proceeding (298) 298
Publication (201) 201
Book Chapter (57) 57
Dissertation (44) 44
Book / eBook (16) 16
Paper (4) 4
Magazine Article (3) 3
Book Review (2) 2
Government Document (1) 1
Report (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (1445) 1445
digraph (982) 982
mathematics, applied (839) 839
digraphs (822) 822
graphs (620) 620
graph theory (530) 530
discrete mathematics and combinatorics (360) 360
algorithms (314) 314
computer science (308) 308
theoretical computer science (244) 244
combinatorics (208) 208
mathematical analysis (198) 198
discrete mathematics (149) 149
computer science, theory & methods (137) 137
analysis (136) 136
graph (132) 132
networks (127) 127
mathematical models (117) 117
diameter (112) 112
engineering, electrical & electronic (108) 108
operations research & management science (108) 108
connectivity (107) 107
geometry and topology (102) 102
mathematics - combinatorics (102) 102
algorithm (101) 101
cycles (101) 101
05c20 (99) 99
tournaments (99) 99
applied mathematics (97) 97
numerical analysis (96) 96
automation & control systems (93) 93
algebra and number theory (87) 87
computer science, information systems (87) 87
statistics & probability (86) 86
computational theory and mathematics (84) 84
complexity (81) 81
kernel (81) 81
studies (81) 81
computer science, hardware & architecture (80) 80
systems (77) 77
cayley digraph (75) 75
optimization (75) 75
tournament (73) 73
mathematics, general (72) 72
number (71) 71
computer science, software engineering (68) 68
trees (67) 67
topology (65) 65
models (64) 64
fault diagnosis (63) 63
computer science, artificial intelligence (61) 61
computer science, interdisciplinary applications (61) 61
engineering, chemical (60) 60
convex and discrete geometry (59) 59
integers (59) 59
matrices (57) 57
paths (57) 57
polynomials (56) 56
gerichteter graph (55) 55
line digraph (55) 55
cycle (54) 54
primitive digraph (54) 54
signed digraph (54) 54
acyclic digraphs (53) 53
design (53) 53
girth (53) 53
engineering design (52) 52
matrix (51) 51
research (51) 51
algebra (50) 50
vertices (50) 50
directed-graphs (49) 49
eigenvalues (49) 49
combinatorial analysis (48) 48
interconnection networks (48) 48
signed digraphs (48) 48
theory of computation (48) 48
directed graphs (47) 47
construction (46) 46
acyclic digraph (44) 44
exponent (44) 44
convergence (43) 43
kernels (43) 43
05c50 (42) 42
directed graph (42) 42
order (42) 42
usage (42) 42
classification (40) 40
multiagent systems (40) 40
chromatic number (38) 38
consensus (38) 38
spectra (38) 38
spectral radius (38) 38
cayley graph (37) 37
computation (37) 37
matemàtiques i estadística (37) 37
àrees temàtiques de la upc (37) 37
adjacency matrix (36) 36
data structures and algorithms (36) 36
logic (36) 36
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Mathematical Sciences - Stacks (6) 6
Gerstein Science - Stacks (4) 4
Collection Dvlpm't (Acquisitions) - Closed Orders (1) 1
Collection Dvlpm't (Acquisitions) - Vendor file (1) 1
Engineering & Comp. Sci. - Stacks (1) 1
Online Resources - Online (1) 1
Robarts - Stacks (1) 1
UofT at Scarborough - Stacks (1) 1
more...
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (3699) 3699
Japanese (33) 33
Chinese (23) 23
French (8) 8
German (4) 4
Portuguese (4) 4
Spanish (3) 3
Polish (2) 2
Croatian (1) 1
Czech (1) 1
Esperanto (1) 1
Indonesian (1) 1
Lithuanian (1) 1
Russian (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Mathematics, ISSN 0012-365X, 05/2020, Volume 343, Issue 5, p. 111816
A digraph D=(V,A) has a good pair at a vertex r if D has a pair of arc-disjoint in- and out-branchings rooted at r. Let T be a digraph with t vertices u1,…,ut... 
Branching | Semicomplete digraph | Digraph composition
Journal Article
Indian Journal of Pure and Applied Mathematics, ISSN 0019-5588, 3/2018, Volume 49, Issue 1, pp. 113 - 127
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2018, Volume 238, pp. 161 - 166
A digraph in which, for every pair of vertices u and v (not necessarily distinct), there is at most one walk of length ≤k from u to v is called a k-geodetic... 
Moore bound | Excess one digraph | Diregularity | Characteristic polynomial | [formula omitted]-geodetic digraph | k-geodetic digraph | MATHEMATICS, APPLIED | kappa-geodetic digraph | MOORE DIGRAPHS
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 06/2017, Volume 85, Issue 2, pp. 545 - 567
The k‐linkage problem is as follows: given a digraph D=(V,A) and a collection of k terminal pairs (s1,t1),…,(sk,tk) such that all these vertices are distinct;... 
polynomial algorithm | disjoint paths | k‐linkage problem | quasi‐transitive digraph | (round‐)decomposable digraphs | locally semicomplete digraph | (round-)decomposable digraphs | k-linkage problem | quasi-transitive digraph | MATHEMATICS | QUASI-TRANSITIVE DIGRAPHS | TOURNAMENTS | LOCALLY SEMICOMPLETE DIGRAPHS
Journal Article
Discussiones Mathematicae Graph Theory, ISSN 2083-5892, 05/2013, Volume 33, Issue 2, pp. 247 - 260
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A digraph D is transitive if for every three distinct vertices... 
4-transitive digraph | k-quasi-transitive digraph | k-transitive digraph | digraph | transitive digraph | quasi-transitive digraph | K-transitive digraph | Transitive digraph | Quasi-transitive digraph | Digraph | K-quasi-transitive digraph | MATHEMATICS | quasi-transitive digraph,4-transitive digraph
Journal Article
Discrete Mathematics, ISSN 0012-365X, 02/2019, Volume 342, Issue 2, pp. 473 - 486
According to Richardson’s theorem, every digraph G without directed odd cycles that is either (a) locally finite or (b) rayless has a kernel (an independent... 
Digraph kernel | End of a digraph | Infinite digraph | MATHEMATICS | DIRECTED-GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 11/2013, Volume 313, Issue 22, pp. 2582 - 2591
Let D=(V(D),A(D)) be a digraph and k≥2 an integer. We say that D is k-quasi-transitive if for every directed path (v0,v1,…,vk) in D we have (v0,vk)∈A(D) or... 
Quasi-transitive digraph | Digraph | [formula omitted]-quasi-transitive digraph | [formula omitted]-king | Digraph k-king | k-quasi-transitive digraph | MATHEMATICS | 4-KINGS | 3-KINGS | k-king | KINGS
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 Applied Mathematics, ISSN 0166-218X, 05/2017, Volume 223, pp. 1 - 14
In this paper, we study the spectra of weighted digraphs, where weights are taken from the set of non zero real numbers. We obtain formulae for the... 
Coulson’s integral formula | Energy of a weighted digraph | Extremal energy | Spectrum of a weighted digraph | Bipartite weighted digraph | McClelland inequality | Coulson's integral formula | SIGNED DIGRAPHS | MATHEMATICS, APPLIED | GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 04/2020, Volume 343, Issue 4, p. 111784
Divisible design digraphs which can be obtained as Cayley digraphs are studied. A characterization of divisible design Cayley digraphs in terms of the... 
Regular group action | Digraph | Divisible design | Cayley digraph
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 07/2019, Volume 137, pp. 118 - 125
Given integers k and m, we construct a G-arc-transitive graph of valency k and an L-arc-transitive oriented digraph of out-valency k such that G and L both... 
Cayley digraphs | Imprimitive digraphs | Arc-transitive digraphs | MATHEMATICS | Imprirnitive digraphs | THEOREM
Journal Article
Advances in Intelligent Systems and Computing, ISSN 2194-5357, 2016, Volume 440, pp. 329 - 339
Conference Proceeding
Discrete Mathematics, ISSN 0012-365X, 10/2018, Volume 341, Issue 10, pp. 2883 - 2893
The concepts of a splicing machine and of an aparalled digraph are introduced. A splicing machine is basically a means to uniquely obtain all circular... 
Splicing | Digraph | MATHEMATICS | DNA
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 06/2017, Volume 303, pp. 24 - 33
The energy of an n-vertex digraph D is defined by E(D)=∑k=1n|Re(zk)|, where z1,…,zn are eigenvalues of D and Re(zk) is the real part of eigenvalue zk. Very... 
Iota energy of digraphs | Bicyclic digraphs | Energy of digraphs | SIGNED DIGRAPHS | MAXIMAL ENERGY | MATHEMATICS, APPLIED | MATCHING ENERGY | LAPLACIAN-ENERGY | GRAPHS
Journal Article
Linear Algebra and Its Applications, ISSN 0024-3795, 04/2012, Volume 436, Issue 7, pp. 2524 - 2530
Let D be a digraph with vertex set V(D) and A be the adjacency matrix of D. In this paper, we characterize the extremal digraphs which achieve the maximum and... 
Bicyclic digraph | θ-Digraph | Digraph | Spectral radius | MATHEMATICS | MATHEMATICS, APPLIED | theta-Digraph | infinity-Digraph
Journal Article
Discrete Mathematics, ISSN 0012-365X, 04/2019, Volume 342, Issue 4, pp. 1128 - 1138
In this paper, based on the calculation using GAP, we give a classification result on arc-transitive Cayley digraphs of finite simple groups. Let G be a finite... 
Simple group | Cayley digraph | Alternatingly connected digraph | Arc-transitive digraph | PRIMITIVE PERMUTATION-GROUPS | MATHEMATICS | AUTOMORPHISM-GROUPS | DEGREE LESS | GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 05/2020, Volume 343, Issue 5, p. 111794
In 1996, Bang-Jensen, Gutin, and Li proposed the following conjecture: If D is a strong digraph of order n where n≥2 with the property that d(x)+d(y)≥2n−1 for... 
Hamiltonian cycle | Digraph | Degree condition
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 09/2019, Volume 269, pp. 68 - 76
We present some applications of a new matrix approach for studying the properties of the lift Γα of a voltage digraph, which has arcs weighted by the elements... 
Abelian group | Voltage digraphs | Quotient digraph | Lifted digraph | Adjacency matrix | Regular partition | Digraph | Generalized Petersen graph | Spectrum | MATHEMATICS, APPLIED | Completeness | Graph theory | Directed graphs | Matemàtica discreta | Grafs, Teoria de | spectrum | Teoria de grafs | Matemàtiques i estadística | Àrees temàtiques de la UPC
Journal Article
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
Applied Mathematics and Computation, ISSN 0096-3003, 04/2019, Volume 347, pp. 702 - 711
The energy of a digraph (sidigraph) is defined as the sum of absolute values of real parts of its eigenvalues. Monsalve and Rada (2016) determined the bicyclic... 
Equienergetic signed digraphs | Energy of signed digraphs | Bicyclic signed digraphs | MATHEMATICS, APPLIED
Journal Article
No results were found for your search.

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