HomeIssuesProof of asymptotic constants in disconnection probability for weighted planar graph

Proof of asymptotic constants in disconnection probability for weighted planar graph | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 2(24).

In this paper, formulas for the calculation of asymptotic constants in the disconnection probability for a weighted planar graph with high reliable edges are proved.
Download file
Counter downloads: 81
  • Title Proof of asymptotic constants in disconnection probability for weighted planar graph
  • Headline Proof of asymptotic constants in disconnection probability for weighted planar graph
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 2(24)
  • Date:
  • DOI
Keywords
вес, грань, цикл, вероятность несвязности, disconnection probability, weighted planar graphs
Authors
References
Harary F. and Manvel B. On the number of cycles in a graph // Matematickycasopis. 1971. No. 21(1). P. 55-63.
Прасолов В. В. Элементы комбинаторной и дифференциальной топологии. М.: МЦНМО, 2004.
Цициашвили Г. Ш., Лосев А. С. Связность планарного графа с высоконадёжными ребрами // Прикладная дискретная математика. 2012. №3(17). С. 102-106.
Tsitsiashvili G. Sh. Complete calculation of disconnection probability in planar graphs // Reliability: The. Appl. 2012. No. 7(1). P. 154-159.
Tsitsiashvili G. Sh., OsipovaM.A., and LosevA.S. Disconnection probability of planar weighted graph // Appl. Math. Sci. 2014. No. 8(10). P. 469-472.
Proof of asymptotic constants in disconnection probability for weighted planar graph | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 2(24).
Proof of asymptotic constants in disconnection probability for weighted planar graph | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2014. № 2(24).
Download full-text version
Counter downloads: 202