A Simple Proof of the Gross-Saccoman Multigraph Conjecture

An enigmatic conjecture in network synthesis asserts that the the uniformly most reliable multigraphs are simple. Daniel Gross and John Saccoman proved in 1998 that the answer is affirmative whenever m ≤ n + 2, where n and m is the respective number of nodes and edges of the multigraphs. They conjec...

Full description

Bibliographic Details

Main Author:	Martínez, Mauro (author)
Other Authors:	Romero, Pablo (author), Viera, Julián (author)
Format:	article
Language:	English
Published:	2022
Subjects:	Network Reliability Gross-Saccoman multigraph conjecture Graph Theory Uniformly Most Reliable Graph Self Similarity Property Multigraph Ciencias Naturales y Exactas Matemáticas Matemática Aplicada
Online Access:	https://hdl.handle.net/20.500.12381/701
Tags:	Add Tag No Tags, Be the first to tag this record!