Let V (G) be the vertex set of a graph G = (V; E) and G ?u be the subgraph induced by the vertex set V (G) ? fug. A vertex u 2 V (G) is said to be a hinge-vertex of G if and only if there exist two… (More)

If the distance of any two vertices becomes longer after a vertex u is removed, then u is called a hinge vertex. The fault of a hinge vertex will increase the overall communication cost in a network.… (More)

A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j) can dominate the… (More)

In a biconnected graph, a detour is the best alternative path from a detour-starting vertex to the destination vertex. A detour-starting vertex is the vertex from which the original shortest path is… (More)

Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our… (More)