Skip to main navigation
Skip to search
Skip to main content
University of Johannesburg Home
Home
Scholars
Research entities
Research output
Press/Media
Equipment & facilities
Prestigious awards
Search by expertise, name or affiliation
Bounds on the fault-diameter of graphs
Peter Dankelmann
Mathematics and Applied Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
5
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Bounds on the fault-diameter of graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Fault Size
100%
Graph Diameter
100%
Connected Graph
42%
K-edge
42%
Edge-connected
28%
4-cycle
14%
Triangle-free Graphs
14%
Large Diameter
14%
Pollack
14%
Triangle-free
14%
Mathematics
Edge
100%
Connected Graph
50%
Triangle
33%
Upper Bound
16%
Free Graph
16%