Decomposing k and into connected unicyclic graphs with 9 edges

HIGHLIGHTS

  • who: Graph decomposition and colleagues from the Department of and Statistics, University of Minnesota Duluth, Duluth, USA have published the research work: Decomposing K and into connected unicyclic graphs with 9 edges, in the Journal: (JOURNAL) of 27/02/2023
  • what: The authors focus the attention on unicyclic graphs with nine edges.

SUMMARY

    The idea of labeling graphs to decompose larger graphs was first introduced by Rosa and has been used extensively since its initial development. Let K be a simple graph, and let G={G0, G1, · · ·, Gs } be a family . . .

     

    Logo ScioWire Beta black

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

    Thanks :)

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

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?