On the fold thickness of graphs
Sign Up to like & getrecommendations! Published in 2020 at "Arabian Journal of Mathematics"
DOI: 10.1007/s40065-020-00276-z
Abstract: The graph $$G'$$ G ′ obtained from a graph G by identifying two nonadjacent vertices in G having at least one common neighbor is called a 1-fold of G . A sequence $$G_0, G_1, G_2,… read more here.
Keywords: graphs fold; thickness graphs; graph; fold thickness ... See more keywords