Article

Free access

Network resilience of star graphs: a comparative analysis

Authors:

Walid Najjar,

Pradip K. SrimaniAuthors Info & Claims

CSC '91: Proceedings of the 19th annual conference on Computer Science

Pages 349 - 357

https://doi.org/10.1145/327164.327295

Published: 01 April 1991 Publication History

PDF eReader

References

[1]

S. B. Akers and B. Krishnamurthy, 'A group theoretic model for symmetric interconnection networks", Proceedings of Intl. Conf. on Parallel Processing, pp. 216-213, 1986.

Google Scholar

[2]

S. B. Akers, D. Harel and B. Krishnamurthy, "The star graph: an attractive alternative to the n-cube", Proceedings of Intl. Conf. on Parallel Processing, pp. 393-400, 1987.

Google Scholar

[3]

S. B. Akers and B. Krishnamurthy, "The fault tolerance of star graphs", Proceedings of 2rid Intl. Conf. on Supercomputing, 1987.

Google Scholar

[4]

W. Najjar and J.-L. Gaudiot, "Network resilience: a measure of network fault tolerance", IEEE Trans. Comput., Vol. 39, pp. 174-181, February 1990.

Digital Library

Google Scholar

[5]

W. Naj.iar and J.-L. Gaudiot, "Reliability and performance modeling of hypercube based multiprocessors", Proceedings of 2rid Intl. Workshop on Appl. Math. Perform. Reliability Models Comput./Commun. Syst., Rome, Italy, 1987.

Google Scholar

[6]

J. Kuhl and S. Reddy, "Fault-tolerance considerations in large multiple-processor systems", IEEE Computer Magazine, Vol. 19, pp. 56-67, March 1986.

Digital Library

Google Scholar

[7]

J. Fortes and C. Raghavendra, "Gracefully degradable processor arrays", IEEE Trans. Comput., Vol. C-34, pp. 1033-1044, November 1985.

Digital Library

Google Scholar

[8]

D. Pradhan, "Fault-tolerant multiprocessor link and bus network architectures, IEEE Trans. Comput., Vol. C-34, pp. 33-45, January 1985.

Google Scholar

[9]

F. Harary, Graph Theory, Addison-Wesley, MA., 1972.

Google Scholar

Cited By

View all

Tortorella MCochran JCox LKeskinocak PKharoufeh JSmith J(2011)Design for Network ResiliencyWiley Encyclopedia of Operations Research and Management Science10.1002/9780470400531.eorms0254Online publication date: 15-Feb-2011
https://doi.org/10.1002/9780470400531.eorms0254
Fei Xing Wenye Wang (2007)Analyzing Resilience to Node Misbehaviors in Wireless Multi-Hop NetworksProceedings of the 2007 IEEE Wireless Communications and Networking Conference10.1109/WCNC.2007.640(3489-3494)Online publication date: 1-Mar-2007
https://dl.acm.org/doi/10.1109/WCNC.2007.640
Chungti Liang Bhattacharya STan J(1994)Performance evaluation of fault-tolerant routing on star networksProceedings of IEEE Scalable High Performance Computing Conference10.1109/SHPCC.1994.296703(650-657)Online publication date: 1994
https://doi.org/10.1109/SHPCC.1994.296703
Show More Cited By

Network resilience of star graphs: a comparative analysis

Recommendations

Star coloring of graphs

A star coloring of an undirected graph G is a proper vertex coloring of G (i.e., no two neighbors are assigned the same color) such that any path of length 3 in G is not bicolored. The star chromatic number of an undirected graph G, denoted by χ_s(G), is ...
Some star extremal circulant graphs

The circular chromatic number @g"c(G) and the fractional chromatic number @g"f(G) are two generalizations of the ordinary chromatic number of a graph G. A graph is called star extremal if its circular chromatic number equals its fractional chromatic ...
Star colouring of bounded degree graphs and regular graphs
Abstract
A k-star colouring of a graph G is a function f : V ( G ) → { 0 , 1 , … , k − 1 } such that f ( u ) ≠ f ( v ) for every edge uv of G, and every bicoloured connected subgraph of G is a star. The star chromatic number of G, χ s ( G ), is ...

Comments

Information & Contributors

Information

Published In

CSC '91: Proceedings of the 19th annual conference on Computer Science

April 1991

711 pages

ISBN:0897913825

DOI:10.1145/327164

Chairmen:
C. Jinshong (C. J.) Hwang
Southwest Texas State Univ., San Marcos
,
Richard Brice
MCC

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
339
Total Downloads

Downloads (Last 12 months)26
Downloads (Last 6 weeks)2

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Tortorella MCochran JCox LKeskinocak PKharoufeh JSmith J(2011)Design for Network ResiliencyWiley Encyclopedia of Operations Research and Management Science10.1002/9780470400531.eorms0254Online publication date: 15-Feb-2011
https://doi.org/10.1002/9780470400531.eorms0254
Fei Xing Wenye Wang (2007)Analyzing Resilience to Node Misbehaviors in Wireless Multi-Hop NetworksProceedings of the 2007 IEEE Wireless Communications and Networking Conference10.1109/WCNC.2007.640(3489-3494)Online publication date: 1-Mar-2007
https://dl.acm.org/doi/10.1109/WCNC.2007.640
Chungti Liang Bhattacharya STan J(1994)Performance evaluation of fault-tolerant routing on star networksProceedings of IEEE Scalable High Performance Computing Conference10.1109/SHPCC.1994.296703(650-657)Online publication date: 1994
https://doi.org/10.1109/SHPCC.1994.296703
Lagman ANajjar WSrimani P(1994)An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular NetworksIEEE Transactions on Computers10.1109/12.27848443:4(470-475)Online publication date: 1-Apr-1994
https://dl.acm.org/doi/10.1109/12.278484

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Star coloring of graphs

Some star extremal circulant graphs

Star colouring of bounded degree graphs and regular graphs

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Recommendations

Star coloring of graphs

Some star extremal circulant graphs

Star colouring of bounded degree graphs and regular graphs

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations