期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (1)
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfec......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (1)
Based on exchanged hypercube, a new interconnection network, exchanged folded hypercube, was proposed recently. It has better properties than other va......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (2)
An edge subset F of G is a fractional matching preclusion set (FMP set for short) if G - F has no fractional perfect matchings. The fractional matchin......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (2)
Let G = (V(G), E(G)) be a non-complete graph, a subset T subset of V (G) is called a r-component cut of G, if G - T is disconnected and has at least r......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (2)
We present an implementation of an eventually perfect failure detector in an arbitrarily connected, partitionable network. We assume ADD channels: for......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (3)
An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processors and communication links, respectively. ......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (3)
The connectivity and diagnosability of a multiprocessor system and an interconnection network are two important research topics. The system and the ne......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (3)
In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (3)
Yoshimi Egawa [8] showed that a 5-connected graph G admits at most 2 vertical bar V(G)vertical bar-10/3 5-shredders. In this paper we shown that a con......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (3)
The g-extra conditional diagnosability and g-extra connectivity are two important parameters to measure ability of diagnosing faulty processors and fa......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (3)
A connected graph G is super edge-connected, if every minimum edge-cut of G is the set of edges incident with a vertex. In this paper, the concept of ......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (3)
The connectivity of a graph G, K(G), is the minimum number of vertices whose removal disconnects G, and the value of K(G) can be determined using Meng......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (3)
Connectivity type measures form an important topic in graph theory. Such measures provide an important part of analyzing the vulnerability and resilie......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (4)
This paper proposes a real-time super-resolution (SR) system. The proposed system performs a fast SR algorithm that generates a high-resolution image ......
期刊： PARALLEL PROCESSING LETTERS, 2020; 30 (4)
For the given n numbers without any other prior information, how to obtain the minimum norm of them only by assigning their signs before them? Moreove......
