View in EDS PDF Full Text ePub Full Text

Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach

Saved in:
Bibliographic Details
Title: Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach
Description: 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.
Authors: John T Saccoman, Daniel J Gross, Charles L Suffel
Resource Type: eBook.
Subjects: Algebra--Graphic methods, Trees (Graph theory)
Categories: MATHEMATICS / Graphic Methods, MATHEMATICS / Combinatorics, MATHEMATICS / Optimization
Database: eBook Collection (EBSCOhost)
FullText Links:
  – Type: ebook-pdf
  – Type: ebook-epub
Text:
  Availability: 0
Header DbId: nlebk
DbLabel: eBook Collection (EBSCOhost)
An: 862322
RelevancyScore: 1057
AccessLevel: 6
PubType: eBook
PubTypeId: ebook
PreciseRelevancyScore: 1057.36352539063
IllustrationInfo
ImageInfo – Size: thumb
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$862322$PDF&s=r
– Size: medium
  Target: https://rps2images.ebscohost.com/rpsweb/othumb?id=NL$862322$PDF&s=d
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 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.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22John+T+Saccoman%22">John T Saccoman</searchLink><br /><searchLink fieldCode="AR" term="%22Daniel+J+Gross%22">Daniel J Gross</searchLink><br /><searchLink fieldCode="AR" term="%22Charles+L+Suffel%22">Charles L Suffel</searchLink>
– Name: TypePub
  Label: Resource Type
  Group: TypPub
  Data: eBook.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Algebra--Graphic+methods%22">Algebra--Graphic methods</searchLink><br /><searchLink fieldCode="DE" term="%22Trees+%28Graph+theory%29%22">Trees (Graph theory)</searchLink>
– Name: SubjectBISAC
  Label: Categories
  Group: Su
  Data: <searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Graphic+Methods%22">MATHEMATICS / Graphic Methods</searchLink><br /><searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Combinatorics%22">MATHEMATICS / Combinatorics</searchLink><br /><searchLink fieldCode="ZK" term="%22MATHEMATICS+%2F+Optimization%22">MATHEMATICS / Optimization</searchLink>
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=nlebk&AN=862322
RecordInfo BibRecord:
  BibEntity:
    Classifications:
      – Code: 511.5
        Scheme: ddc
        Type: prePub
    Languages:
      – Code: eng
        Text: English
    Subjects:
      – SubjectFull: Algebra--Graphic methods
        Type: general
      – SubjectFull: Trees (Graph theory)
        Type: general
    Titles:
      – TitleFull: Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: John T Saccoman
      – PersonEntity:
          Name:
            NameFull: Daniel J Gross
      – PersonEntity:
          Name:
            NameFull: Charles L Suffel
      – PersonEntity:
          Name:
            NameFull: John T Saccoman
      – PersonEntity:
          Name:
            NameFull: Daniel J Gross
      – PersonEntity:
          Name:
            NameFull: Charles L Suffel
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2014
            – D: 16
              M: 10
              Type: profile
              Y: 2014
          Identifiers:
            – Type: isbn-print
              Value: 9789814566032
            – Type: isbn-electronic
              Value: 9789814566049
            – Type: isbn-electronic
              Value: 9789814566056
          Titles:
            – TitleFull: Spanning Tree Results For Graphs And Multigraphs: A Matrix-theoretic Approach
              Type: main
ResultId 1