X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
diameter vulnerability (16) 16
connectivity (8) 8
fault tolerance (8) 8
mathematics (8) 8
graphs (7) 7
line digraph iteration (7) 7
diameter-vulnerability (6) 6
computer science, hardware & architecture (5) 5
networks (5) 5
spread (5) 5
diameter (4) 4
graph theory (4) 4
computer science (3) 3
container (3) 3
discrete mathematics and combinatorics (3) 3
fault diameter (3) 3
fault-tolerance (3) 3
interconnection networks (3) 3
iterated line digraphs (3) 3
kautz graph (3) 3
mathematics, applied (3) 3
operations research & management science (3) 3
paths (3) 3
communication networks (2) 2
computer science, theory & methods (2) 2
cycles (2) 2
de bruijn graph (2) 2
dense digraphs (2) 2
diameter variability (2) 2
digraphs (2) 2
engineering, electrical & electronic (2) 2
fault-diameter (2) 2
girth (2) 2
interconnection network (2) 2
k-diameter (2) 2
vulnerability (2) 2
wide diameter (2) 2
-dominating set (1) 1
-domination (1) 1
-problem (1) 1
[formula omitted]-dominating set (1) 1
[formula omitted]-domination (1) 1
application (1) 1
applied mathematics (1) 1
approximation algorithms (1) 1
arc-disjoint hamilton cycles (1) 1
assessment (1) 1
backbone (1) 1
bipartite digraphs (1) 1
bounded edge-connectivity (1) 1
bounds (1) 1
broadcasting (1) 1
bruijn digraphs (1) 1
buried pipeline (1) 1
cartesian product (1) 1
combinatorics (1) 1
communication-network vulnerability (1) 1
compound graphs (1) 1
containers (1) 1
de bruijn and kautz digraphs (1) 1
de bruijn digraphs (1) 1
de-bruijn (1) 1
debbruijn digraphs (1) 1
debruijn (1) 1
debruijn digraphs (1) 1
debruijn graph (1) 1
degruijn graph (1) 1
delay (1) 1
deletion (1) 1
design (1) 1
diameter‐vulnerability (1) 1
directed-graphs (1) 1
discrete mathematics (1) 1
disruption tolerant networking (1) 1
distribution (1) 1
earthquake (1) 1
edge-connected graph (1) 1
edge-connectivity (1) 1
edge-deletion (1) 1
edge-disjoint branchings (1) 1
edge-fault-diameter (1) 1
edge-fault-tolerant diameter (1) 1
edge-persistence (1) 1
edge‐fault‐diameter (1) 1
edge‐fault‐tolerant diameter (1) 1
factor (1) 1
fault-tolerant diameter (1) 1
fault-tolerant networks (1) 1
fault‐diameter (1) 1
fault‐tolerant diameter (1) 1
generalized cycles (1) 1
generalized petersen graph (1) 1
grafs, teoria de (1) 1
graph (1) 1
graph, connectivity (1) 1
hypercubes (1) 1
independent spanning trees (1) 1
informàtica (1) 1
joint (1) 1
kappa-diameter (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


TURKISH JOURNAL OF MATHEMATICS, ISSN 1300-0098, 2018, Volume 42, Issue 6, pp. 2897 - 2915
The diameter of a graph gives the length of the longest path among all the shortest paths between any two vertices of the graph, and the diameter vulnerability... 
Diameter vulnerability | MATHEMATICS | generalized Petersen graph | fault tolerance | paths
Journal Article
International Journal of Applied Engineering Research, ISSN 0973-4562, 09/2015, Volume 10, Issue 16, pp. 37070 - 37075
Journal Article
Networks, ISSN 0028-3045, 09/2017, Volume 70, Issue 2, pp. 132 - 140
Journal Article
AKCE International Journal of Graphs and Combinatorics, ISSN 0972-8600, 04/2016, Volume 13, Issue 1, pp. 31 - 37
Efficiency and reliability are two important criteria in the designing of a good interconnection network. Network topological notions such as wide diameter,... 
Diameter vulnerability | Wide diameter | (l, k)-domination | Fault diameter | Mycielskian | (l,k)-domination
Journal Article
Discrete Mathematics, ISSN 0012-365X, 2009, Volume 309, Issue 4, pp. 1001 - 1006
Let be the maximum diameter of graphs obtained by deleting edges from a -edge-connected graph with diameter . This paper shows for , which corrects an improper... 
Diameter vulnerability | Edge-deletion | Edge-connected graph | Diameter | MATHEMATICS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2012, Volume 160, Issue 12, pp. 1859 - 1863
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2009, Volume 157, Issue 15, pp. 3249 - 3257
The bounded edge-connectivity of a connected graph with respect to is the minimum number of edges in whose deletion from results in a subgraph with diameter... 
Cycles | Hypercubes | Edge-persistence | Paths | Bounded edge-connectivity | Diameter | Cartesian product | MATHEMATICS, APPLIED | COMMUNICATION-NETWORK VULNERABILITY | DIAMETER VULNERABILITY | DELETION
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2001, Volume 110, Issue 2, pp. 189 - 211
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 07/2003, Volume 304, Issue 1-3, pp. 461 - 469
Many interconnection networks can be constructed with line digraph iterations. A digraph has super link-connectivity d if it has link-connectivity d and every... 
Super link-connectivity | Interconnection networks | Line digraph iterations | line digraph iterations | EDGE-CONNECTIVITY | COMPUTER SCIENCE, THEORY & METHODS | interconnection networks | LARGE GENERALIZED CYCLES | super link-connectivity | DIAMETER-VULNERABILITY | GRAPHS | Computer science
Journal Article
Networks, ISSN 0028-3045, 03/2005, Volume 45, Issue 2, pp. 49 - 54
Iterated line digraphs arise naturally in designing fault tolerant systems. Diameter vulnerability measures the increase in diameter of a digraph when some of... 
Kautz digraph | girth | diameter vulnerability | deBruijn digraphs | Diameter vulnerability | DeBbruijn digraphs | Girth | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | CONNECTIVITY | CYCLES | GRAPHS
Journal Article
Ars Combinatoria, ISSN 0381-7032, 08/1998, Volume 49, pp. 97 - 111
Journal Article
ARS COMBINATORIA, ISSN 0381-7032, 08/1998, Volume 49, pp. 97 - 111
A (Delta, D', s)-digraph is a digraph with maximum out-degree Delta such that after the deletion of any s of its vertices the resulting digraph has diameter at... 
MATHEMATICS | fault tolerance | dense digraphs | diameter vulnerability | DIGRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 1999, Volume 197, Issue 1-3, pp. 285 - 298
A generalized p-cycle is a digraph whose set of vertices is partitioned in p parts that can be ordered in such a way that a vertex is adjacent only to vertices... 
Generalized cycles | Iterated line digraphs | Fault-tolerant networks | Fault-diameter | fault-diameter | MATHEMATICS | DESIGN | generalized cycles | iterated line digraphs | BIPARTITE DIGRAPHS | fault-tolerant networks | DIAMETER-VULNERABILITY | GRAPHS
Journal Article
Taiwanese Journal of Mathematics, ISSN 1027-5487, 9/1999, Volume 3, Issue 3, pp. 281 - 290
Many interconnection networks can be constructed with line digraph iterations. In this paper, we will establish a general theorem on diameter vulnerability... 
Line graphs | Connectivity | Mathematics | Multisets | Vertices | line digraph iteration | MATHEMATICS | diameter vulnerability | interconnection network | CONNECTIVITY | GRAPHS
Journal Article
Taiwanese Journal of Mathematics, ISSN 1027-5487, 1999, Volume 3, Issue 3, pp. 281 - 290
Journal Article
IEEE Transactions on Computers, ISSN 0018-9340, 06/1996, Volume 45, Issue 6, p. 768
The aim of this note is to present some counterexamples to the results in the paper by Du, Lyuu, and Hsu (see ibid., vol.42, no.5, p.612-16, May 1993). 
Fault tolerance | Diameter-vulnerability | Line digraph iteration | Connectivity | Spread | Fault-tolerance
Journal Article
IEEE TRANSACTIONS ON COMPUTERS, ISSN 0018-9340, 06/1996, Volume 45, Issue 6, pp. 768 - 768
The aim of this note is to present some counterexamples to the results in the paper by Du, Lyuu, and Hsu published in this transactions [1]. 
line digraph iteration | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | connectivity | fault-tolerance | diameter-vulnerability | spread | ENGINEERING, ELECTRICAL & ELECTRONIC
Journal Article
by DU, DZ and LYUU, YD and HSU, DF
IEEE TRANSACTIONS ON COMPUTERS, ISSN 0018-9340, 05/1993, Volume 42, Issue 5, pp. 612 - 616
A graph has spread (m, k, l) if for any m + 1 distinct nodes x, y1, ... , y(m) and m positive integers r1, ... , r(m) such that SIGMA(i)r(i) = k, there exist k... 
COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | KAPPA-DIAMETER | NETWORKS | GRAPH THEORY | KAUTZ GRAPH | ENGINEERING, ELECTRICAL & ELECTRONIC | LINE DIGRAPH ITERATION | CONNECTIVITY | CONTAINER | DIAMETER VULNERABILITY | SPREAD | FAULT TOLERANCE | DEGRUIJN GRAPH
Journal Article
No results were found for your search.

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