On locally most reliable three-terminal graphs of sparse graphs

A network structure with n vertices and m edges is practically represented by a graph with n vertices and m edges. The graph with k fixed target vertices is called a k-terminal graph. This article studies the locally most reliable simple sparse three-terminal graphs, in which each edge survives inde...

Full description

Bibliographic Details

Published in:	AIMS Mathematics
Main Authors:	Sun Xie, Haixing Zhao, Liming Dai, Jun Yin
Format:	Article
Language:	English
Published:	AIMS Press 2021-05-01
Subjects:	target vertices rst-subgraph three-terminal graph reliability polynomial locally most reliable graph uniformly most reliable graph
Online Access:	https://www.aimspress.com/article/doi/10.3934/math.2021439?viewType=HTML