دانلود کتاب Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach

Name: Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach
Availability: InStock
Author: Daniel J Gross
ISBN: 9814566039, 9789814566032

by Daniel J Gross

عنوان فارسی: پوشا درخت برای نمودار ها و گرافهای چندگانه: روش ماتریس تئوری
ناشر: World Scientific Publishing Company
سال: 2014
زبان: انگلیسی
تعداد صفحه (نسخه چاپی - نسخه الکترونیکی): 200-186
شابک: 9814566039, 9789814566032
نوع فایل: PDF دانلود نرم افزار مطالعه
حجم: 2.00 مگابایت

گزارش تخلف

دانلود کتاب

افزودن خلاصه فارسی

جزییات کتاب

This book is concerned with the optimization problem of maximizing the number of spanning trees of a multigraph. Since a spanning tree is a minimally connected subgraph, graphs and multigraphs having more of these are, in some sense, immune to disconnection by edge failure. We employ a matrix-theoretic approach to the calculation of the number of spanning trees. The authors envision this as a research aid that is of particular interest to graduate students or advanced undergraduate students and researchers in the area of network reliability theory. This would encompass graph theorists of all stripes, including mathematicians, computer scientists, electrical and computer engineers, and operations researchers.Readership: Graduate students and researchers in combinatorics and graph theory.

کتاب های مرتبط

این کتاب رو مطالعه کردید؟ نظر شما چیست؟

برای ارسال نظر، لطفا وارد شوید.

نظر دهید

Adding comments has been disabled.

نظرات (0)

هنوز نظری داده نشده است. شما اولین باشید!