X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (501) 501
Book / eBook (154) 154
Publication (82) 82
Paper (39) 39
Conference Proceeding (35) 35
Book Chapter (32) 32
Dissertation (15) 15
Patent (4) 4
Magazine Article (3) 3
Book Review (2) 2
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
physics (185) 185
atoms and molecules in strong fields, laser matter interaction (146) 146
mathematics (112) 112
atoms (110) 110
electronic books (101) 101
matter (101) 101
mathematics, applied (73) 73
connectivity (69) 69
plasma physics (65) 65
plasma (64) 64
strong connectivity (64) 64
multi-user (61) 61
graphs (60) 60
physique (60) 60
science (59) 59
analysis (58) 58
mechanics (47) 47
physical chemistry (46) 46
computer science (45) 45
mathematical models (40) 40
algorithms (39) 39
graph theory (39) 39
astrophysics (38) 38
atoms and molecules in strong fields, plasma physics (38) 38
engineering (38) 38
mathematical analysis (37) 37
index medicus (36) 36
optics, lasers, photonics, optical devices (36) 36
solid state physics (32) 32
spectroscopy (32) 32
lasers (31) 31
networks (31) 31
organic chemistry (31) 31
spectroscopy/spectrometry (29) 29
computer science, theory & methods (28) 28
astronomie (27) 27
mathematics, interdisciplinary applications (27) 27
photonics (27) 27
computer simulation (26) 26
optics (26) 26
quantum theory (26) 26
computer science, information systems (25) 25
models (24) 24
particles (24) 24
research (24) 24
strong interactions (24) 24
nuclear physics (23) 23
quantum physics (23) 23
technology & engineering (23) 23
physics, atomic, molecular & chemical (22) 22
strong ties (22) 22
studies (22) 22
astrophysics and astroparticles (21) 21
classical electrodynamics (21) 21
materials science, multidisciplinary (21) 21
general (20) 20
algorithm (19) 19
atomic, molecular, optical and plasma physics (19) 19
congresses (19) 19
extraterrestrial physics, space sciences (19) 19
gaseous discharge (19) 19
gaseous plasma (19) 19
magnetoplasma (19) 19
materials (19) 19
social networks (19) 19
chemistry (18) 18
dynamics (18) 18
finite element method (18) 18
complexity (17) 17
condensed matter (17) 17
electrodynamics (17) 17
energy (17) 17
laser technology, photonics (17) 17
combinatorics (16) 16
engineering, multidisciplinary (16) 16
optimization (16) 16
quantum mechanics (16) 16
space sciences (16) 16
approximation (15) 15
astronomical physics (15) 15
astronomy (15) 15
chemistry, multidisciplinary (15) 15
computer science, software engineering (15) 15
geophysics/geodesy (15) 15
mathematical physics (15) 15
performance (15) 15
strong product (15) 15
biology (14) 14
engineering, electrical & electronic (14) 14
geophysics (14) 14
magnetism (14) 14
model (14) 14
neurosciences (14) 14
nuclear energy (14) 14
weak ties (14) 14
chemistry, physical (13) 13
computation (13) 13
ecology (13) 13
electronics (13) 13
fault tolerance (13) 13
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Gerstein Science - Stacks (35) 35
Collection Dvlpm't (Acquisitions) - Vendor file (12) 12
Mathematical Sciences - Stacks (6) 6
Physics - Stacks (5) 5
Online Resources - Online (4) 4
Robarts - Stacks (4) 4
UofT at Mississauga - Stacks (3) 3
OISE - Stacks (2) 2
St. Michael's College (John M. Kelly) - 2nd Floor (2) 2
UofT at Scarborough - Stacks (2) 2
Victoria University E.J. Pratt - Stacks (2) 2
Astronomy & Astrophysics - Ask at library (1) 1
Astronomy & Astrophysics - Stacks (1) 1
Engineering & Comp. Sci. - Stacks (1) 1
Gerstein Science - Circulation Desk (1) 1
Music - Stacks (1) 1
Physics - New Books (1) 1
more...
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (720) 720
German (17) 17
French (13) 13
Japanese (5) 5
Arabic (4) 4
Chinese (3) 3
Korean (2) 2
Turkish (2) 2
Czech (1) 1
Spanish (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal of Graph Theory, ISSN 0364-9024, 09/2019, Volume 92, Issue 1, pp. 5 - 18
Generalized connectivity introduced by Hager [J. Combin. Theory Ser. B 38 (1985), pp. 179–189] has been studied extensively in undirected graphs and become an... 
digraphs | symmetric digraphs | directed k‐linkage | generalized k‐connectivity | semicomplete digraphs | strong subgraph k‐connectivity | directed k-linkage | strong subgraph k-connectivity | generalized k-connectivity | GRAPH | MATHEMATICS | DISJOINT PATHS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 01/2018, Volume 707, pp. 56 - 68
A connected graph G is called strongly Menger (edge) connected if for any two distinct vertices x,y of G, there are min⁡{degG⁡(x),degG⁡(y)}(-edge)-disjoint... 
Strong Menger (edge) connectivity | Fault-tolerance | Balanced hypercube | Maximal local-connectivity | g-Extra (edge) connectivity | STAR GRAPHS | AUGMENTED CUBES | NETWORKS | RELIABILITY | FOLDED HYPERCUBES | CONDITIONAL FAULTS | BIPANCYCLICITY | LOCAL-CONNECTIVITY | EXTRACONNECTIVITY | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Information, Communication & Society, ISSN 1369-118X, 06/2005, Volume 8, Issue 2, pp. 125 - 147
This paper explores the impact of communication media and the Internet on connectivity between people. Results from a series of social network studies of media... 
communication theory | computer-mediated communication | strong ties | social networks | latent ties | weak ties | Internet | Social networks | Latent ties | Communication theory | Computer-mediated communication | Strong ties | Weak ties
Journal Article
Information and Computation, ISSN 0890-5401, 08/2018, Volume 261, pp. 248 - 264
Given a directed graph, two vertices v and w are 2-vertex-connected if there are two internally vertex-disjoint paths from v to w and two internally... 
Strong articulation points | Dominators | Connectivity | Flow graph | Directed graph | MATHEMATICS, APPLIED | COMPONENTS | COMPUTER SCIENCE, THEORY & METHODS | Computer Science
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 01/2020, Volume 804, pp. 72 - 80
Let G be an(a) edge(vertex)-colored graph. A path P of G is called a conflict-free path if there is a color that is used on exactly one of the edges(vertices)... 
Strong conflict-free connection | Polynomial-time algorithm | Conflict-free connection | Complexity | COMPUTER SCIENCE, THEORY & METHODS | GRAPHS
Journal Article
Information Sciences, ISSN 0020-0255, 03/2017, Volume 382-383, pp. 326 - 333
Connectivity concepts in fuzzy incidence graphs are discussed in this article. Fuzzy incidence graphs are important in interconnection networks with influenced... 
Fuzzy incidence graph | Fuzzy incidence tree | Strong pair | COMPUTER SCIENCE, INFORMATION SYSTEMS | ARCS | Trees | Networks | Graphs | Fuzzy | Interconnection | Incidence
Journal Article
IEEE Transactions on Parallel and Distributed Systems, ISSN 1045-9219, 08/2015, Volume 26, Issue 8, pp. 2352 - 2362
Journal Article
Journal Article
Information Processing Letters, ISSN 0020-0190, 09/2017, Volume 125, pp. 30 - 34
Motivated by parallel routing in networks with faults and evaluating the reliability of networks, we consider strong Menger connectivity of the folded... 
Fault tolerance | Folded hypercubes | Strong Menger connectivity | Path system | Conditional faults | SUPER-EDGE-CONNECTIVITY | TERMS | COMPUTER SCIENCE, INFORMATION SYSTEMS | RELIABILITY | 3 FAMILIES | CYCLES | SYSTEMS | INTERCONNECTION NETWORKS
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 04/2016, Volume 81, Issue 4, pp. 393 - 402
Let D be a digraph and let λ(D) be the arc‐strong connectivity of D, and α′(D) be the size of a maximum matching of D. We proved that if λ(D)≥α′(D)>0, then D... 
eulerian digraphs | maximum matching | strong arc connectivity | supereulerian digraphs | MATHEMATICS | GRAPHS
Journal Article
IEEE Transactions on Signal Processing, ISSN 1053-587X, 12/2012, Volume 60, Issue 12, pp. 6590 - 6603
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 07/2013, Volume 161, Issue 10-11, pp. 1467 - 1471
In [L. Volkmann, Restricted arc-connectivity of digraphs, Inform. Process. Lett. 103 (2007) 234–239], L. Volkmann introduced a concept of restricted... 
[formula omitted]-optimal | Restricted arc-connectivity | Arc-degree | Strong tournaments | λ′-optimal | MATHEMATICS, APPLIED | lambda '-optimal | Networks | Graph theory | Mathematical analysis | Sharpness
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 01/2015, Volume 181, pp. 33 - 40
An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processor and communication links, respectively.... 
Bubble-sort star graph | Fault-tolerant | Maximal local-connectivity | MATHEMATICS, APPLIED | HYPERCUBE | COMPONENT | STRONG MENGER-CONNECTIVITY | Networks | Fault tolerance | Microprocessors | Interconnection | Stars | Links | Graphs | Mathematical models | Graph theory
Journal Article
Fundamenta Informaticae, ISSN 0169-2968, 2018, Volume 160, Issue 4, pp. 447 - 463
We consider an augmentation problem to establish point-to-point connectivity on unweighted graphs where there is no restriction on choosing the augmenting... 
bridge-connectivity | FPT-Algorithm | strong-connectivity | point-To-point connectivity | Graph augmentation | GRAPH | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | FPT-algorithm | COMPLEXITY | ALGORITHMS | point-to-point connectivity | DELIVERY | Augmentation | Graphs | Graph theory | Parameters
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 11/2019, Volume 793, pp. 181 - 192
The t/k-diagnosis, a famous diagnosis strategy, is proposed by Somani and Peleg. In this strategy, all the faulty vertices, no more than t, can be isolated... 
The [formula omitted]-diagnosability | Connectivity | Fault-tolerance | Strong Menger connectivity | Star graph | The t/k-diagnosability | LOCAL-CONNECTIVITY | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Journal of Archaeological Method and Theory, ISSN 1072-5369, 12/2018, Volume 25, Issue 4, pp. 974 - 995
While network techniques are now used with some frequency in archaeology for tackling questions of connectivity and mobility at regional and inter-regional... 
Social Sciences | Aegean | Globalization | Minoanization | Mobility | Anthropology | Multiscalar | Data model | Archaeology | Theory model | Network | Material culture | Connectivity | Bronze Age | STRENGTH | ARCHAEOLOGY | WHEEL | STRONG TIES | CRITICAL MASS | PROTOPALATIAL CRETE | SOCIAL NETWORKS | ANTHROPOLOGY | COLLECTIVE ACTION | BRONZE-AGE | Analysis | Models
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 06/2018, Volume 728, pp. 1 - 8
Menger's theorem is a characterization of the connectivity in finite graphs in terms of the minimum number of disjoint paths that can be found between any pair... 
Hypercubes | Folded hypercubes | Connectivity | Strong Menger connectivity | Fault-tolerance | Strong Menger edge connectivity | STAR GRAPHS | LOCAL-CONNECTIVITY | COMPUTER SCIENCE, THEORY & METHODS | FAULTS
Journal Article
Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, ISSN 1539-3755, 11/2015, Volume 92, Issue 5, p. 052317
In this paper, we investigate effects of counterion connectivity (i.e., association of the counterions into a chain molecule) on the electrostatic potential of... 
MONTE-CARLO | MIXTURES | WALLS | HARD-SPHERE FLUID | STRONG-COUPLING THEORY | ASYMMETRIC ELECTROLYTES | PHYSICS, FLUIDS & PLASMAS | ATTRACTION | DEPLETION | MODEL | PHYSICS, MATHEMATICAL | WATER
Journal Article
Information Sciences, ISSN 0020-0255, 07/2014, Volume 273, pp. 387 - 392
The connectivity of a graph is an important issue in graph theory, and is also one of the most important factors in evaluating the reliability and fault... 
Fault tolerance | Connectivity | Augmented cube | Connected component | Vertex-disjoint path | STAR GRAPHS | SUPER-EDGE-CONNECTIVITY | COMPUTER SCIENCE, INFORMATION SYSTEMS | 3 FAMILIES | FAULTY VERTICES | TOPOLOGICAL PROPERTIES | HYPERCUBE | INTERCONNECTION NETWORKS | STRONG MENGER-CONNECTIVITY
Journal Article