Sufficient conditions for k-connected graphs and k-leaf-connected graphs
Sign Up to like & getrecommendations! Published in 2024 at "Filomat"
DOI: 10.2298/fil2418601a
Abstract: A connected graph G is said to be k-connected if it has more than k vertices and remains connected whenever fewer than k vertices are deleted. In this paper, we present a sufficient condition in… read more here.
Keywords: sufficient conditions; connected graphs; leaf connected; graphs leaf ... See more keywords