摘要:

AbstractSimple necessary and sufficient conditions for a list of integers to be the degrees of the points of a tree are wellknown. Unicyclic graphs, which are connected graphs with exactly one cycle, are considered here. A simple set of necessary and sufficient conditions for a list of integers to be the degrees of the points of such a graph is derived.

ISSN:0028-3045    

DOI:10.1002/net.3230080202

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY

摘要:

AbstractA mean‐time comparison of the algorithms of Floyd, Dantzig, Tabourier, and of repeated application of several single‐source algorithms, for the all‐pairs shortest‐path problem with arbitrary arc lengths clearly demonstrates the superiority of the Tabourier procedure for networks in which an average of at least 25% of the potential direct arcs are present. For very sparse networks, repeated application of a single‐source label‐correcting algorithm is found to be

ISSN:0028-3045    

DOI:10.1002/net.3230080203

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY

摘要:

AbstractIn this paper we investigate the nature of integer solutions to multicommodity network flow problems from a graphtheoretic viewpoint. A sufficient condition for unimodularity is developed that is based upon the topological characteristics of the associated graph, and the results are applied to certain well‐structured example

ISSN:0028-3045    

DOI:10.1002/net.3230080204

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY

摘要:

AbstractA graph H is called total if there exists a graph G such that there is a one‐to‐one correspondence between the vertices of H and the vertices and edges of G such that two vertices of H are adjacent iff the corresponding elements of G are adjacent or incident.In this paper we present a linear time algorithm for the recognition of the total graphs. The algorithm is based on the breadth‐first search tech

ISSN:0028-3045    

DOI:10.1002/net.3230080205

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY

摘要:

AbstractThis work extends the results of M. Rosenfeld [6] on universal graphs with respect to the strong graph product. By using a generalized measure of independence, one can get improved bounds on the growth of the maximum independent set size under this graph product. Furthermore, a necessary and sufficient condition is derived for when the maximum independent set of the product graph is strictly greater than the product of the maximum independent sets.

ISSN:0028-3045    

DOI:10.1002/net.3230080206

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY

摘要:

AbstractThe problem of evaluating some basic traffic tormulae is considered here from a computational point of view. The specific problems include the evaluation of Poisson, Erlang B and Erlang C blocking functions and their associated inverses. Formulae related to Wilkinson's nonrandom traffic theory are also included. The methods presented are simple, efficient and accurate. They are based on several newly derived formulae and are ideally suited for extensive computerized network analysis, design and optimization problems. These methods have been incorporated into the simulator of the Canadian network. This simulator is widely used in analyzing the usage of the network as well as in assessing the impact of changing loads which arise from shifts in the economy, demand or rates.

ISSN:0028-3045    

DOI:10.1002/net.3230080207

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230080201

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY