Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
The largest matching roots of unicyclic graphs with a fixed matching number
by
Chen, Guangting
, Zhang, Hailiang
in
Graph matching
/ Graphs
/ Root matching
/ Roots
2017
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
The largest matching roots of unicyclic graphs with a fixed matching number
by
Chen, Guangting
, Zhang, Hailiang
in
Graph matching
/ Graphs
/ Root matching
/ Roots
2017
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
The largest matching roots of unicyclic graphs with a fixed matching number
Journal Article
The largest matching roots of unicyclic graphs with a fixed matching number
2017
Request Book From Autostore
and Choose the Collection Method
Overview
In this note, we study the largest matching roots of unicyclic graphs with a given number of fixed matching number. We also characterize the extremal graph with respect to the largest matching roots. In addition, we also study this problem on the trees with a given number of fixed matching number.
Publisher
Taylor & Francis Ltd
Subject
This website uses cookies to ensure you get the best experience on our website.