A note on a problem of Capobianco and Molluzzo
Dănuţ Marcu · Le Matematiche · 1986
The aim of this paper is to solve a problem of Capobianco and Molluzzo [2, pag. 65]. More exactly, we show that for any two integers n and m, 1 there exists a graph G, such that k(G)=n and k[L(G)]=m, where k(G) denotes the connectivity of G , and L(G) the line graph of G.