Partitioning harary graphs into connected subgraphs containing prescribed vertices

HIGHLIGHTS

• who: DMTCS vol. and colleagues from the UnivBordeaux, LaBRI, UMR, Talence, France have published the Article: Partitioning Harary graphs into connected subgraphs containing prescribed vertices, in the Journal: (JOURNAL)
• what: The authors investigate the least possible size of an AP+k graph. The authors show that these graphs are not necessarily AP+2.

SUMMARY

For every k ≥ 1, the set of complete graphs on at least k vertices is a trivial class of AP+k graphs, these graphs having the largest possible size. In this scope, the authors focus on optimal . . .

 



If you want to have access to all the content you need to log in!

Thanks :)

Username or Email

Password

Remember me

Lost your password?

If you don't have an account, you can create one here.