The g-Extra Connectivity of the Strong Product of Paths and Cycles
Sign Up to like & getrecommendations! Published in 2022 at "Symmetry"
DOI: 10.3390/sym14091900
Abstract: Let G be a connected graph and g be a non-negative integer. A vertex set S of graph G is called a g-extra cut if G−S is disconnected and each component of G−S has at… read more here.
Keywords: connectivity strong; extra cut; strong product; extra connectivity ... See more keywords