ABSTRACT
In Chapter 18, we discussed the mutually independent hamiltonicity of graph G. Similarly, we can discuss the mutually independent Hamiltonian connectivity of graph G. A graph is k mutually independent Hamiltonian connected if there exist k mutually independent Hamiltonian paths between any two distinct vertices. Moreover, the mutually independent Hamiltonian connectivity of a graph G, IHP(G), is the maximum integer k such that G is k mutually independent Hamiltonian connected.
