Connectedness strength of two vertices in an uncertain graph

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.90, Iss.2, 2013-02, pp. : 246-257

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Coverings of the Vertices of a Graph by Small Cycles

By Forge David Kouider Mekkia

Graphs and Combinatorics, Vol. 23, Iss. 2, 2007-04 ,pp. : 135-143

Springer Publishing Company

Access to resources Recommend Favorite

Cover time of a random graph with a degree sequence II: Allowing vertices of degree two

RANDOM STRUCTURES AND ALGORITHMS, Vol. 45, Iss. 4, 2014-12 ,pp. : 627-674

John Wiley & Sons Inc

Access to resources Recommend Favorite

Largest connected component of a star graph with faulty vertices

By Yang Xiaofan

International Journal of Computer Mathematics, Vol. 85, Iss. 12, 2008-12 ,pp. : 1771-1778

Taylor & Francis Ltd

Access to resources Recommend Favorite

Coloring the vertices of a graph with majority restrictions on colors

By Vizing V.

Journal of Applied and Industrial Mathematics, Vol. 4, Iss. 2, 2010-04 ,pp. : 270-275

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four

By Ando Kiyoshi Egawa Yoshimi

Graphs and Combinatorics, Vol. 23, Iss. 1, 2007-06 ,pp. : 99-115

Springer Publishing Company

Access to resources Recommend Favorite