Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs
A balanced bipartite graph G is said to be 2p-Hamilton-biconnected if for any balanced subset W of size 2p of V(G), the subgraph induced by V(G)nW is Hamilton-biconnected. In this paper, we prove that ?Let G be a balanced bipartite graph of order 2n with minimum degree ?(G) ? k, where n ? 2k-p+2 for two integers k ? p ? 0. If the number of edges e(G) > n(n-k + p-1) + (k + 2)(k-p+1), then G is 2p-Hamilton-biconnected except some exceptions.? Furthermore, this result is used to present two new spectral conditions for a graph to be 2p-Hamilton-biconnected. Moreover, the similar results are also presented for nearly balanced bipartite graphs.
2014 ◽
Vol Vol. 16 no. 3
◽
Keyword(s):
2012 ◽
Vol 22
(1)
◽
pp. 71-96
◽
Keyword(s):
2019 ◽
Vol 2
(8)
◽
pp. 6-9
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):