Combinatorial Analysis of Star Graph Networks (original) (raw)

The Conditional Fault-Diameter of the K-ary n-Cube

Abderezak Touzene

Sultan Qaboos University Journal for Science [SQUJS], 2005

View PDFchevron_right

On the k-subgraphs of the generalized n-cubes

Jaime Caro

View PDFchevron_right

Fault Diameter of Star Graphs

Pradip K

Information Processing Letters, 1993

View PDFchevron_right

Analysis of a Class of Networks Based on Cubic Star Graphs

S Lakshmivarahan

Journal of Circuits, Systems and Computers, 1994

View PDFchevron_right

Fault Tolerance on Star Graphs

Chang-Biau Yang

International Journal of Foundations of Computer Science, 1997

View PDFchevron_right

Linearly many faults in dual-cube-like networks

Laszlo Liptak

Theoretical Computer Science, 2013

View PDFchevron_right

A comparative performance analysis of n-cubes and star graphs

Abbas Kiasari

Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006

View PDFchevron_right

Node-to-Node Disjoint Paths in k-ary n-cubes with Faulty Edges

Yonghong Xiang

2011

View PDFchevron_right

The generalized 3-connectivity and 4-connectivity of crossed cube

Dongqin Cheng

Discussiones Mathematicae Graph Theory

View PDFchevron_right

Defending Planar Graphs against Star-Cutsets

Adrian Vetta

Electronic Notes in Discrete Mathematics, 2009

View PDFchevron_right

Partial cubes and their -graphs

Matjaz Kovse

European Journal of Combinatorics, 2007

View PDFchevron_right

A Comparative Study of Star Graphs and Rotator Graphs

Vipin Chaudhary

1994 International Conference on Parallel Processing-Vol 1 (ICPP'94), 1994

View PDFchevron_right

Note on the bisection width of cubic graphs

Jeno Lehel

Discrete Applied Mathematics, 2020

View PDFchevron_right

Embedding Long Paths in k-Ary n-Cubes with Faulty Nodes and Links

Yonghong Xiang

IEEE Transactions on Parallel and Distributed Systems, 2008

View PDFchevron_right

On middle cube graphs

Margarida Mitjana

arXiv: Combinatorics, 2016

View PDFchevron_right

Subcube fault-tolerance in hypercubes

Quentin F Stout

View PDFchevron_right

Embedding Starlike Trees into Hypercube-Like Interconnection Networks

Jung-Heum Park

Frontiers of High Performance Computing and Networking ā€“ ISPA 2006 Workshops, 2006

View PDFchevron_right

Longest fault-free paths in star graphs with vertex faults

Chin-Wen Ho

Theoretical Computer Science, 2001

View PDFchevron_right

On induced subgraphs of the cube

Ronald Graham

Journal of Combinatorial Theory, Series A, 1988

View PDFchevron_right

The star arboricity of graphs

Edward Schmeichel

Discrete Mathematics, 1989

View PDFchevron_right

On the acyclic point-connectivity of the n-cube

John Mitchem

International Journal of Mathematics and Mathematical Sciences, 1982

View PDFchevron_right

Graphs of order n with fault-tolerant partition dimension n-1

Muhammad Salman

Upb Scientific Bulletin Series a Applied Mathematics and Physics, 2014

View PDFchevron_right

Fault-Tolerant Metric Dimension of Cube of Paths

Laxman Saha

Journal of Physics: Conference Series

View PDFchevron_right

Longest fault-free paths in star graphs with edge faults

Chin-Wen Ho

IEEE Transactions on Computers, 2001

View PDFchevron_right

A comparative study of topological properties of hypercubes and star graphs

Anand Tripathi

IEEE Transactions on Parallel and Distributed Systems, 1994

View PDFchevron_right

Fault-diameter of the star-connected cycles interconnection network

Marcelo De Azevedo

1995

View PDFchevron_right

GRAPHS OF ORDER n WITH FAULT-TOLERANT PARTITION DIMENSION nāˆ’

Muhammad Imran

View PDFchevron_right

Paired many-to-many disjoint path covers in restricted hypercube-like graphs

Jung-Heum Park

Theoretical Computer Science, 2016

View PDFchevron_right

The minimum size of graphs satisfying cut conditions

Jeno Lehel

Discrete Applied Mathematics, 2018

View PDFchevron_right

Combinatorial results on the Extended Star graph with Cross Connections

pious missier

IOSR Journal of Mathematics, 2012

View PDFchevron_right

Bipancyclicity in k-Ary n-Cubes with Faulty Edges under a Conditional Fault Assumption

Yonghong Xiang

IEEE Transactions on Parallel and Distributed Systems, 2011

View PDFchevron_right

Critical Analysis on the Classical Topological Properties of the Star Graph, Hypercube and Perfect Difference Network for Distributed Systems

Interal Res journa Managt Sci Tech

View PDFchevron_right

On the number of cut-vertices in a graph

Glenn Hopkins, William Staton

International Journal of Mathematics and Mathematical Sciences, 1989

View PDFchevron_right

Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs

Jung-Heum Park

Theoretical Computer Science, 2016

View PDFchevron_right

The (n, k)-star graph: A generalized star graph

Wei-Kuo Chiang

Information Processing Letters, 1995

View PDFchevron_right

Fault TolerantDisjoint Paths