X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (3416) 3416
Conference Proceeding (300) 300
Publication (203) 203
Book Chapter (57) 57
Dissertation (43) 43
Book / eBook (17) 17
Paper (5) 5
Magazine Article (4) 4
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 (1462) 1462
digraph (994) 994
mathematics, applied (840) 840
digraphs (817) 817
graphs (615) 615
graph theory (555) 555
discrete mathematics and combinatorics (353) 353
algorithms (315) 315
computer science (305) 305
theoretical computer science (240) 240
combinatorics (209) 209
mathematical analysis (193) 193
discrete mathematics (150) 150
computer science, theory & methods (139) 139
analysis (137) 137
graph (133) 133
networks (127) 127
mathematical models (118) 118
engineering, electrical & electronic (112) 112
diameter (111) 111
operations research & management science (110) 110
connectivity (105) 105
geometry and topology (102) 102
algorithm (101) 101
mathematics - combinatorics (101) 101
cycles (100) 100
automation & control systems (96) 96
tournaments (96) 96
applied mathematics (95) 95
numerical analysis (93) 93
computer science, information systems (92) 92
05c20 (87) 87
algebra and number theory (87) 87
statistics & probability (85) 85
computational theory and mathematics (84) 84
complexity (82) 82
kernel (81) 81
computer science, hardware & architecture (80) 80
cayley digraph (76) 76
studies (76) 76
tournament (75) 75
number (73) 73
optimization (72) 72
mathematics, general (71) 71
computer science, software engineering (70) 70
systems (70) 70
trees (68) 68
fault diagnosis (63) 63
topology (63) 63
computer science, artificial intelligence (62) 62
models (62) 62
integers (61) 61
engineering, chemical (60) 60
line digraph (59) 59
computer science, interdisciplinary applications (58) 58
convex and discrete geometry (58) 58
matrices (58) 58
polynomials (58) 58
gerichteter graph (56) 56
cycle (55) 55
paths (55) 55
signed digraph (55) 55
primitive digraph (54) 54
research (53) 53
design (52) 52
engineering design (52) 52
algebra (51) 51
girth (51) 51
matrix (51) 51
combinatorial analysis (50) 50
vertices (50) 50
eigenvalues (49) 49
acyclic digraphs (48) 48
directed graphs (48) 48
directed-graphs (48) 48
interconnection networks (48) 48
signed digraphs (48) 48
construction (46) 46
theory of computation (46) 46
acyclic digraph (45) 45
convergence (45) 45
exponent (44) 44
kernels (43) 43
directed graph (42) 42
multiagent systems (42) 42
classification (41) 41
consensus (41) 41
order (41) 41
usage (40) 40
chromatic number (38) 38
computation (38) 38
oriented graph (38) 38
spectra (38) 38
spectral radius (38) 38
upper bounds (38) 38
cayley graph (37) 37
logic (37) 37
matemàtiques i estadística (37) 37
àrees temàtiques de la upc (37) 37
adjacency matrix (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 (5) 5
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 (3721) 3721
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


Ars Mathematica Contemporanea, ISSN 1855-3966, 2018, Volume 14, Issue 2, pp. 375 - 385
Journal Article
Journal Article
Journal of Algebra, ISSN 0021-8693, 02/2020, Volume 544, pp. 75 - 91
A fascinating problem on digraphs is the existence problem of the finite upper bound on s for all vertex-primitive s-arc-transitive digraphs except directed... 
Vertex-primitive | Upper bound | s-arc-transitive digraph | MATHEMATICS | FINITE | SUBGROUPS
Journal Article
Journal of Logic and Computation, ISSN 0955-792X, 10/2018, Volume 28, Issue 7, pp. 1635 - 1646
For the classical backward induction algorithm, the input is an arbitrary n-person positional game with perfect information modelled by a finite acyclic... 
positional structure | directed cycle | Deterministic graphical (multistage) game | digraph | Nash-solvability | game in normal and in positional form | directed graph | Nash equilibrium | saddle point | game form | acyclic digraph | GAMES | LOGIC | PERFECT INFORMATION | COMPUTER SCIENCE, THEORY & METHODS | PURE STATIONARY STRATEGIES
Journal Article
Journal of Applied and Industrial Mathematics, ISSN 1990-4789, 04/2017, Volume 11, Issue 2, pp. 215 - 226
We develop amatrix-graph approach to estimating themixing properties of bijective shift registers over a set of binary vectors. Such shift registers... 
shift register | modified additive generator | primitive digraph | additive generator | exponent of a digraph | mixing digraph | Parameter modification | Properties (attributes) | Mathematical analysis | Shift registers | Graph theory | Generators | Encryption | Cryptography
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
Electronic Journal of Graph Theory and Applications, ISSN 2338-2287, 2014, Volume 2, Issue 2, pp. 150 - 159
A k-geodetic digraph G is a digraph in which, for every pair of vertices u and v (not necessarily distinct), there is at most one walk of length at most k from... 
k-geodetic digraph, moore digraph, the degree/diameter problem, almost moore digraph
Journal Article
Journal of Interconnection Networks, ISSN 0219-2659, 06/2018, Volume 18, Issue 2-3
Journal Article
Electronic Journal of Linear Algebra, ISSN 1537-9582, 2018, Volume 34, pp. 343 - 355
Journal Article
Bulletin of the Polish Academy of Sciences: Technical Sciences, ISSN 0239-7528, 10/2018, Volume 66, Issue 5, pp. 589 - 597
Journal Article
Computers and Chemical Engineering, ISSN 0098-1354, 04/2019, Volume 123, pp. 170 - 183
•A hierarchical approach for causal inferencing to decouple cyclic and non-cyclic effects in complex systems.•Incorporating information from process flowsheets... 
Process industries | Digraph | Transfer entropy | Hierarchical approach | Causal models | SIGNED DIGRAPHS | ENGINEERING, CHEMICAL | HAZOP ANALYSIS TOOL | PLANT | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | PHASUITE | CHEMICAL-PROCESSES | Usage | Algorithms | Artificial intelligence | Analysis
Journal Article
Discussiones Mathematicae Graph Theory, 11/2019, Volume 39, Issue 4, pp. 815 - 828
Let D be any of the 10 digraphs obtained by orienting the edges of K4 − e. We establish necessary and sufficient conditions for the existence of a (Kn*$K_n^*$,... 
orientations of K4 − e | digraph decompositions | 05C51 | 05B30
Journal Article
Kragujevac Journal of Mathematics, ISSN 1450-9628, 2016, Volume 40, Issue 1, pp. 79 - 89
Journal Article
Czechoslovak Mathematical Journal, ISSN 0011-4642, 9/2016, Volume 66, Issue 3, pp. 701 - 715
We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius,... 
Ordinary Differential Equations | 05C50 | nonnegative matrix | digraph | Analysis | Convex and Discrete Geometry | Mathematics, general | Mathematics | Mathematical Modeling and Industrial Mathematics | spectral radius | graph | 15A18 | MATHEMATICS | LARGEST LAPLACIAN EIGENVALUE | DIGRAPHS | graph digraph | GRAPHS
Journal Article
Linear Algebra and Its Applications, ISSN 0024-3795, 10/2013, Volume 439, Issue 7, pp. 1825 - 1833
The energy of a digraph D is defined as E(D)=∑i=1n|Re(zi)|, where Re(zi) denotes the real part of the complex number zi. We study in this work the energy over... 
Directed hexagonal systems | Energy of a digraph | MATHEMATICS, APPLIED | PI-ELECTRON ENERGY | DIGRAPHS
Journal Article
JOURNAL OF ALGEBRA AND ITS APPLICATIONS, ISSN 0219-4988, 11/2019, Volume 18, Issue 11
Let f be a monic polynomial over a finite field F-q, and k >= 2 an integer. A digraph G( f, k) is one whose vertex set is F-q[x]/< f > and for which there is a... 
MATHEMATICS | MATHEMATICS, APPLIED | power digraphs | SYMMETRIC DIGRAPHS | direct product of digraphs | Polynomial over finite fields | uniqueness of factorization
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2009, Volume 309, Issue 23, pp. 6555 - 6562
A digraph is arc-locally in-semicomplete if for any pair of adjacent vertices x , y , every in-neighbor of x and every in-neighbor of y either are adjacent or... 
Arc-locally semicomplete digraphs | Semicomplete digraphs | Semicomplete bipartite digraphs | Digraphs | MATHEMATICS | PATHS
Journal Article
Journal of Mathematical Inequalities, ISSN 1846-579X, 2015, Volume 9, Issue 3, pp. 799 - 810
The eigenvalues of a graph are the eigenvalues of its adjacency matrix. The energy of a graph is the sum of absolute values of its eigenvalues. Recently, the... 
Bicyclic digraphs | Energy of digraphs | MATHEMATICS | MATHEMATICS, APPLIED | bicyclic digraphs | UNICYCLIC GRAPHS
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 05/2015, Volume 112, pp. 138 - 153
We say a digraph G is a minor of a digraph H if G can be obtained from a subdigraph of H by repeatedly contracting a strongly-connected subdigraph to a vertex.... 
Well-quasi-order | Minor | Digraph | Tournament | MATHEMATICS | GRAPH MINORS
Journal Article
No results were found for your search.

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