Full Hermite interpolation of the reliability of a hammock network

DOI10.2298/AADM190805017DzbMath1474.05205MaRDI QIDQ4988989

Marilena Jianu, Leonard Dăuş

Publication date: 20 May 2021

Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

connected graphlattice pathreliability polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Interpolation in approximation theory (41A05) Connectivity (05C40)

Related Items (2)

MARKOV CHAIN METHOD FOR COMPUTING THE RELIABILITY OF HAMMOCK NETWORKS ⋮ A barycentric trigonometric Hermite interpolant via an iterative approach

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• A history and a survey of lattice path enumeration
• A Generalization of Hermite's Interpolation Formula
• The Complexity of Enumeration and Reliability Problems
• Some enumerations of non-trivial compositions of the differential operations and the directional derivative
• Some combinatorial aspects of differential operation compositions on space $R^n$
• Reliable circuits using less reliable relays

This page was built for publication: Full Hermite interpolation of the reliability of a hammock network