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, ...
In this paper we investigate the property of Hamiltonian connectedness for some undirected Toeplitz graphs. MF Nadeem,A Shabbir,T Zamfirescu 被引量: 1发表: 2015年 ON s-HAMILTONIAN-CONNECTED LINE GRAPHS line graph is hamil-tonian-connected (see [Z. Ryják and P. Vrána, Line graphs of ...
In this graph, each country is a “node,” and the connecting line between nodes represents the co-publication relationship between the two countries. Since the paper collaboration is mutual, the network structure graph is undirected. Figure 1 depicts the evolution of the scientific collaboration ...
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...
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...
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 ...