Saibal Banerjee, An optimal algorithm to find the degrees of connectedness in an undirected edge - fuzzy graph, Pattern Recognition letters. 12 (7) (1991) 421-424.Saibal Banerjee, An optimal algorithm to find the degrees of connectedness in an undirected edge - weighted graph, Pattern ...
Presents a general spitting formula for computing the connectedness probability (overall reliability) of connected undirected graphs. To be precise, let G split into two subgraphs H and K which are edge disjoint and meet in n common vertices, U= V( H)cap V( K). Let P ( U) denote the ...
Hamiltonian Connectedness of Toeplitz GraphsA Toeplitz graph is a graph with a Toeplitz adjacency matrix. In this paper we investigate the property of Hamiltonian connectedness for some undirected Toeplitz graphs.doi:10.1007/978-3-0348-0859-0_8Muhammad Faisal NadeemAyesha ShabbirTudor Zamfirescu...
Kao, On the hamiltonian-connectedness for graphs satisfying Ore's theorem, in Smart Innovation, Systems and Technologies, Advances in Intelligent System and Applications, Vol. 1, R-S. Chang, L.C. Jain, and S-L. Peng, eds., Proceedings of the International Computer Symposium ICS 2012, ...
w Introduction Motivated by the existence of largest and smallest proper connectednesses and disconnectednesses in the categories of topological spaces (Top) and undirected graphs with loops (Graph), we look for necessary and sufficient conditions for the existence of such classes in a general ...
GraphsReliabilityMathematical modelsNetworksHosesNodesProbabilitySynthesisReprintsThere is an extensive literature on the reliability model of an undirected graphwhose edges operate with independent probabilities but whose nodes are perfectly reliable. Herein we consider the less studied case where the nodes ...
Knowledge about protein function is often encoded in the form of large and sparse undirected graphs where vertices are proteins and edges represent their functional relationships. One elementary task...doi:10.1007/978-3-540-71681-5_21Jol Pradines...