• Anglický jazyk

Minimum Rank and Path Cover Number of Certain Graphs

Autor: Rupam Shankar Nath

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... Viac o knihe

Na objednávku

36.99 €

bežná cena: 41.10 €

O knihe

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.

  • Vydavateľstvo: LAP LAMBERT Academic Publishing
  • Rok vydania: 2020
  • Formát: Paperback
  • Rozmer: 220 x 150 mm
  • Jazyk: Anglický jazyk
  • ISBN: 9786203025514

Generuje redakčný systém BUXUS CMS spoločnosti ui42.