It is commonly believed that vertex-transitive graphs (and in particular Cayley graphs) tend to contain hamilton cycles. The only known connected vertex-transitive graphs without hamilton cycles are K ...
Ask the publishers to restore access to 500,000+ books. A line drawing of the Internet Archive headquarters building façade. An illustration of a heart shape "Donate to the archive" An illustration of ...
College of Mathematics and System Sciences, Xinjiang University, Urumqi, China. The traditional connectivity and edge-connectivity, are important measures for networks, which can correctly reflect the ...
A line drawing of the Internet Archive headquarters building façade. An illustration of a magnifying glass. An illustration of a magnifying glass.
ABSTRACT: Tian and Meng in [Y. Tian and J. Meng, λc -Optimally half vertex transitive graphs with regularity k, Information Processing Letters 109 (2009) 683 - 686] shown that a connected half vertex ...
Abstract: A graph is said to be vertex bi-primitive, if it is a bipartite graph, and the setwise stabilizer of its automorphism group acts primitively on two bi-parts. In this paper, we not only ...
In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear ...
In networks modeling interactions between agents (e.g. people, computers), the agents often have a limited capacity to form interactions. If the vertex degrees grow with the size of the network, the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback