X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
pancyclicity (184) 184
hypercubes (95) 95
graphs (88) 88
interconnection networks (80) 80
networks (67) 67
computer science, information systems (65) 65
edge-pancyclicity (64) 64
cycles (60) 60
panconnectivity (59) 59
fault tolerance (58) 58
mathematics, applied (57) 57
computer science, theory & methods (56) 56
mathematics (56) 56
interconnection network (48) 48
computer science (42) 42
bipancyclicity (38) 38
cubes (38) 38
connectivity (36) 36
hypercube (36) 36
graph theory (34) 34
hamiltonicity (34) 34
computer science, hardware & architecture (32) 32
crossed cubes (31) 31
algorithms (27) 27
engineering, electrical & electronic (27) 27
cycle embedding (25) 25
interconnection (25) 25
hamiltonian cycle (24) 24
mobius cubes (23) 23
computer science, software engineering (21) 21
fault-tolerance (21) 21
paths (21) 21
theoretical computer science (21) 21
hamiltonian (19) 19
hamiltonian cycles (19) 19
optimization (19) 19
augmented cubes (18) 18
cycle (18) 18
folded hypercubes (18) 18
k-ary n-cubes (18) 18
embedding (17) 17
fault-tolerant (17) 17
embeddings (16) 16
faults (16) 16
path (16) 16
topological properties (16) 16
topology (16) 16
twisted cubes (16) 16
computer networks (15) 15
discrete mathematics and combinatorics (15) 15
bipanconnectivity (14) 14
crossed cube (14) 14
graph-theoretic interconnection networks (13) 13
pancyclic (13) 13
vertex-pancyclicity (13) 13
hamiltonian path (12) 12
locally twisted cubes (12) 12
mathematical models (12) 12
linear-array (11) 11
star graphs (11) 11
algorithm (10) 10
diagnosability (10) 10
mathematical analysis (10) 10
node-pancyclicity (10) 10
parallel processing (10) 10
studies (10) 10
trees (10) 10
usage (10) 10
free hamiltonian cycles (9) 9
hamiltonian-connectivity (9) 9
integers (9) 9
network topology (9) 9
applied mathematics (8) 8
dilation (8) 8
edge-bipancyclicity (8) 8
elements (8) 8
multiprocessor interconnection networks (8) 8
network (8) 8
program processors (8) 8
vertex (8) 8
vertices (8) 8
analysis (7) 7
ary n-cubes (7) 7
block (7) 7
combinatorics (7) 7
computation (7) 7
construction (7) 7
fault tolerant systems (7) 7
geodesic-pancyclicity (7) 7
locally twisted cube (7) 7
möbius cube (7) 7
torus (7) 7
05c38 (6) 6
alternating group graph (6) 6
cartesian product (6) 6
computer science, general (6) 6
fault-tolerant embedding (6) 6
hamilton cycle (6) 6
hamiltonian connectivity (6) 6
independent spanning trees (6) 6
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Applied Mathematics and Computation, ISSN 0096-3003, 08/2017, Volume 307, pp. 180 - 192
The balanced hypercube, BHn, is a variant of hypercube Qn. Hao et al. (2014) showed that there exists a fault-free Hamiltonian path between any two adjacent... 
Hypercubes | Edge-pancyclicity | Fault-tolerance | Balanced hypercubes | Edge pancyclicity | MATHEMATICS, APPLIED | HAMILTONIAN LACEABILITY | CUBES
Journal Article
Information Sciences, ISSN 0020-0255, 12/2014, Volume 287, pp. 131 - 139
In this paper, we study the pancyclic properties of the WK-Recursive networks. We show that a WK-Recursive network with amplitude W and level L is... 
Edge pancyclicity | Vertex pancyclicity | Recursive networks | Interconnection networks | RESOURCE PLACEMENT | COMPUTER SCIENCE, INFORMATION SYSTEMS | NODE-PANCYCLICITY | HAMILTONIAN-CONNECTIVITY | Lower bounds | Networks | Amplitudes | Interconnection
Journal Article
Discussiones Mathematicae Graph Theory, 11/2019, Volume 39, Issue 4, pp. 867 - 879
For integers n ≥ k ≥ 2, let c(n, k) be the minimum number of chords that must be added to a cycle of length n so that the resulting graph has the property that... 
11B75 | 05D99 | chords | pancyclicity
Journal Article
Discrete Mathematics, ISSN 0012-365X, 01/2018, Volume 341, Issue 1, pp. 151 - 154
Let G be a simple m×n bipartite graph with m≥n. We prove that if the minimum degree of G satisfies δ(G)≥m∕2+1, then G is bipanconnected: for every pair of... 
Circumference | Panconnectivity | Bipartite graph | MATHEMATICS | PANCYCLICITY
Journal Article
Journal of Parallel and Distributed Computing, ISSN 0743-7315, 02/2016, Volume 88, pp. 57 - 62
The n-dimensional locally twisted cube LTQn is a variant of the hypercube, which possesses some properties superior to the hypercube. This paper investigates... 
Fault-tolerant | Locally twisted cubes | Vertex-pancyclicity
Journal Article
by Chen, WD and Ling, S
COMPUTER JOURNAL, ISSN 0010-4620, 01/2017, Volume 60, Issue 1, pp. 1 - 12
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 02/2017, Volume 84, Issue 2, pp. 176 - 190
A k‐hypertournament H on n vertices (2≤k≤n) is a pair H=(V,A), where V is the vertex set of H and A is a set of k‐tuples of vertices, called arcs, such that... 
arc‐pancyclicity | tournament | regularity | hypertournament | arc-pancyclicity | MATHEMATICS | SEQUENCES | SCORES | K-HYPERTOURNAMENTS | HAMILTONIAN CYCLES
Journal Article
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, ISSN 0743-7315, 02/2016, Volume 88, pp. 57 - 62
The n-dimensional locally twisted cube LTQ(n), is a variant of the hypercube, which possesses some properties superior to the hypercube. This paper... 
Fault-tolerant | EDGE-PANCYCLICITY | Locally twisted cubes | Vertex-pancyclicity | PATHS | NETWORKS | COMPUTER SCIENCE, THEORY & METHODS | PANCONNECTIVITY
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 2008, Volume 197, Issue 2, pp. 760 - 767
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 2007, Volume 155, Issue 15, pp. 1971 - 1978
A shortest path connecting two vertices u and v is called a u - v geodesic. The distance between u and v in a graph G, denoted by d G ( u , v ) , is the number... 
Traceability | Pancyclicity | Hamiltonicity | Vertex-pancyclicity | Edge-pancyclicity | Geodesic-pancyclicity | Panconnectivity | MATHEMATICS, APPLIED | vertex-pancyclicity | pancyclicity | edge-pancyclicity | hamiltonicity | traceability | geodesic-pancyclicity | panconnectivity | Computer science
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 08/2018, Volume 331, pp. 287 - 296
A graph G of k vertices is panconnected if for any two distinct vertices x and y, it has a path of length l joining x and y for any integer l satisfying... 
Interconnection network | Crossed cube | Path embedding | Hamiltonian | Panconnected | MATHEMATICS, APPLIED | TOPOLOGICAL PROPERTIES | PANCYCLICITY | AUGMENTED CUBES | HYPERCUBE
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 12/2016, Volume 215, pp. 164 - 170
A k-hypertournament H on n vertices with 2≤k≤n is a pair H=(V,AH), where V is a set of n vertices and AH is a set of k-tuples of vertices, called arcs, such... 
Hypertournament | Pancyclicity | Tournament | MATHEMATICS, APPLIED | HAMILTONIAN CYCLES | VERTEX | Motorcycles
Journal Article
International Journal of Foundations of Computer Science, ISSN 0129-0541, 01/2017, Volume 28, Issue 1, pp. 61 - 76
The (s + t + 1)-dimensional exchanged crossed cube, denoted by ECQ(s,t), proposed by Li et al., combines the advantages of the hypercube and the crossed cube.... 
embeddability | exchanged crossed cube | pancyclicity | Interconnection networks | HYPERCUBES | MOBIUS CUBES | CONNECTIVITY | EDGE-PANCYCLICITY | COMPUTER SCIENCE, THEORY & METHODS | PATH BIPANCYCLICITY | GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 07/2017, Volume 340, Issue 7, pp. 1639 - 1644
Graph G of order n is said to be pancyclic if it contains cycles of all lengths k for k∈{3,…,n}. A vertex v∈V(G) is called super-heavy if its degree in G is at... 
Pancyclicity | Hamilton cycle | Fan-type heavy subgraph | MATHEMATICS | HAMILTONICITY
Journal Article
IEICE Transactions on Information and Systems, ISSN 0916-8532, 2018, Volume E101.D, Issue 12, pp. 2916 - 2921
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 2007, Volume 191, Issue 2, pp. 314 - 319
A graph G = ( V , E ) is vertex-pancyclic if for every vertex u and any integer l ranging from a positive constant L to | V | , G contains a cycle C of length... 
Graph-theoretic interconnection networks | Augmented cubes | Cycle embedding | Vertex-pancyclicity | HYPERCUBES | MATHEMATICS, APPLIED | NETWORK | vertex-pancyclicity | PANCYCLICITY | graph-theoretic interconnection networks | cycle embedding | augmented cubes | GRAPHS
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 10/2013, Volume 510, pp. 94 - 101
The augmented cube AQn, proposed by Choudum and Sunitha [7], is a variation of the hypercube Qn and possesses many superior properties that the hypercube does... 
Interconnection network | Pancyclicity | Augmented cubes | Faulty edges | Fault-tolerant embedding | HAMILTONICITY | CYCLES | HYPERCUBE | COMPUTER SCIENCE, THEORY & METHODS | VERTICES | TOLERANT PANCONNECTIVITY | GEODESIC-PANCYCLICITY
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2012, Volume 160, Issue 4-5, pp. 548 - 559
Recently, Chan et al. introduced geodesic-pancyclic graphs [H.C. Chan, J.M. Chang, Y.L. Wang, S.J. Horng, Geodesic-pancyclic graphs, Discrete Applied... 
Balanced pancyclicity | Generalized base-[formula omitted] hypercubes | Interconnection networks | Weakly geodesic pancyclicity | Generalized base-b hypercubes | MATHEMATICS, APPLIED | EDGE-PANCYCLICITY | PANCONNECTIVITY | HAMILTONIAN-CONNECTIVITY
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 09/2014, Volume 242, pp. 127 - 142
The balanced hypercube BHn proposed by Wu and Huang is a variation of the hypercube. It has been proved that the balanced hypercube is a node-transitive and... 
Path | Interconnection network | Embedding | Node-disjoint | Balanced hypercube | MATHEMATICS, APPLIED | STAR GRAPHS | EDGE-PANCYCLICITY | HAMILTONICITY | CROSSED CUBES | FOLDED HYPERCUBES | FAULTS
Journal Article
No results were found for your search.

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