Multigraphic Degree Sequences and Hamiltonian-connected Line Graphs
【摘要】:
Let G be a multigraph.Suppose that e=u_1 v_1 and e'=u_2 v_2 are two edges of G.If e≠e',then G(e,e') is the graph obtained fro...
問答