26,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
  • Broschiertes Buch

This book is based on the two pioneering works on the relationship between minimum rank and path cover number of a graph. We have tried to understand and work out the results obtained from the two research papers. The relationship between the minimum rank of a tree to its several invariants including the path cover number has been worked out from the first paper. Formulae for the minimum rank of vertex sums of graphs and formulae for the minimum rank and path cover number for graphs obtained from edge-sums have been derived from the second paper.

Produktbeschreibung
This book is based on the two pioneering works on the relationship between minimum rank and path cover number of a graph. We have tried to understand and work out the results obtained from the two research papers. The relationship between the minimum rank of a tree to its several invariants including the path cover number has been worked out from the first paper. Formulae for the minimum rank of vertex sums of graphs and formulae for the minimum rank and path cover number for graphs obtained from edge-sums have been derived from the second paper.
Autorenporträt
Mr. Rupam Shankar Nath has done M.Sc. in Mathematics and Computing from IIT Guwahati, INDIA. He cleared his CSIR UGC NET in December 2019. He is committed to promoting higher Mathematics by his unique way of teaching, guiding, and motivating students.