A good set on k vertices is a vertex induced subgraph of the hypercube Q_n that has the maximum number of edges. In this paper we discuss graph theoretic properties of good sets including connectivity, vertex decomposition, domination and identifying path covers of good sets.doi:10.1080/23799927.2024.2305937S. A. TapadiaN. V. ...
✓Subject Category: Operations Research/Graph Theory. ✓Refers also to: ♦Breadth-First Search. ♦Diophantine Equations. Diophantine equations denote a system whose solutions must be integer-valued. The linear system Ax=b for x∈ℤn can be solved in polynomial time. ✓Subject Category: ...
Baroin, G.: The planet-4D model: an original hypersymmetric music space based on graph theory. In: Agon, C., Andreatta, M., Assayag, G., Amiot, E., Bresson, J., Mandereau, J. (eds.) Mathematics and Computation in Music, MCM 2011. LNCS (LNAI), vol. 6726, pp. 326–329. Sp...
Graph Theory, in press. Google Scholar [2] B. Bollobás, Extremal Graph Theory, Reprint of the 1978 original, Dover Publications, Inc., Mineola, NY, 2004. Google Scholar [3] J. Bondy, M. Simonovits Cycles of even lengths in graphs J. Combin. Theory Ser. B, 16 (1974), pp. 97-...
To Artificial Intelligence in Theory and Practice 239 do this we must create an appropriate construction graph for the ants to follow. We must then decide on an appropriate pheromone matrix and heuristic information to influence the paths the ants will take through the graph. We present the ...
Let G be a finite connected graph and T be a spanning tree. For any edge e of T, let A e , B e be the components of T e. The edge congestion of e in T is defined as e c G ( e , T ) = | { u v ∣ u ∈ A e , v ∈ B e } |, and the congestion of T is ...
Comparison of simulation results in solving the 2-way graph partitioning problem with this new GA, the simple GA and the good point GA shows that this new method has superiority in speed, accuracy and precision. 参考文献(共11条): [1] KANG S,MOON B R,A hybrid genetic algorithm for multi...
Graph Theory Network topology Qubits References Abraham S, Padmanabhan K (1991) The twisted cube topology for multiprocessors: a study in network asymmetry. J Parallel Distrib Comput 13(1):104–110 Article Google Scholar Akers SB, Harel D, Krishnamurthy B (1989) A group-theoretic model fo...
RegisterLog in Sign up with one click: Facebook Twitter Google Share on Facebook hypercube (redirected fromhypercubes) Encyclopedia hy·per·cube (hī′pər-kyo͞ob′) n. 1.Any of a set of objects resulting from the generalization of a two-dimensional square and a three-dimensional cube...
The super restricted edge-connectivity of a graph is an important parameter to measure fault-tolerance ofinterconnection networks. 图的超级限制边连通性是度量计算机互连网络可靠性(容错性)的一个重要参数。 2. By means of the theory of isomorphic graph, the proposed algorithm is extended to some other...