소장자료
LDR | 02704cam a22003257a 4500 | ||
001 | 0093142002▲ | ||
003 | DLC▲ | ||
005 | 20180519000434▲ | ||
008 | 141215t20152015njua b 001 0 eng c▲ | ||
010 | ▼a2014497378▲ | ||
020 | ▼a9789814566032▲ | ||
020 | ▼a9814566039▲ | ||
035 | ▼a(OCoLC)ocn861207554▲ | ||
040 | ▼aBTCTA▼beng▼cBTCTA▼dYDXCP▼dCDX▼dCUS▼dDLC▲ | ||
042 | ▼alccopycat▲ | ||
050 | 0 | 0 | ▼aQA166▼b.G756 2015▲ |
082 | 0 | 4 | ▼a511.5▼223▲ |
090 | ▼a511.5▼bG878s▲ | ||
100 | 1 | ▼aGross, Daniel J.▼q(Daniel Joseph)▲ | |
245 | 1 | 0 | ▼aSpanning tree results for graphs and multigraphs :▼ba matrix-theoretic approach /▼cDaniel J. Gross, John T. Saccoman, Charles L. Suffel.▲ |
260 | ▼aNew Jersey :▼bWorld Scientific Publishing Co. Pte. Ltd.,▼c2015.▲ | ||
300 | ▼ax, 175 p. :▼bill. ;▼c24 cm.▲ | ||
504 | ▼aIncludes bibliographical references (p. 169-171) and index.▲ | ||
505 | 0 | ▼a0. An introduction to relevant graph theory and matrix theory. 0.1. Graph theory. 0.2. Matrix theory -- 1. Calculating the number of spanning trees: The algebraic approach. The node-arc incidence matrix. 1.2. Laplacian matrix. 1.3. Special graphs. 1.4. Temperley's B-matrix. 1.5. Multigraphs. 1.6. Eigenvalue bounds for multigraphs. 1.7. Multigraph complements. 1.8. Two maximum tree results -- 2. Multigraphs with the maximum number of spanning Trees: An analytic approach. 2.1. The maximum spanning tree problem. 2.2. Two maximum spanning tree results -- 3. Threshold graphs. 3.1. Characteristic polynomials of threshold graphs. 3.2. Minimum number of spanning trees -- 4. Approaches to the multigraph problem -- 5. Laplacian integral graphs and multigraphs. 5.1. Complete graphs and related structures. 5.2. Split graphs and related structures. 5.3. Laplacian integral multigraphs.▲ | |
520 | ▼aThis 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.--▼cSource other than Library of Congress.▲ | ||
650 | 0 | ▼aGraph theory▼xData processing.▲ | |
650 | 0 | ▼aGraph theory▼xResearch.▲ | |
700 | 1 | ▼aSaccoman, John T.,▼d1964-▲ | |
700 | 1 | ▼aSuffel, Charles.▲ | |
999 | ▼c김정이▲ |
Spanning tree results for graphs and multigraphs :a matrix-theoretic approach
자료유형
국외단행본
서명/책임사항
Spanning tree results for graphs and multigraphs : a matrix-theoretic approach / Daniel J. Gross, John T. Saccoman, Charles L. Suffel.
개인저자
발행사항
New Jersey : World Scientific Publishing Co. Pte. Ltd. , 2015.
형태사항
x, 175 p. : ill. ; 24 cm.
서지주기
Includes bibliographical references (p. 169-171) and index.
내용주기
0. An introduction to relevant graph theory and matrix theory. 0.1. Graph theory. 0.2. Matrix theory -- 1. Calculating the number of spanning trees: The algebraic approach. The node-arc incidence matrix. 1.2. Laplacian matrix. 1.3. Special graphs. 1.4. Temperley's B-matrix. 1.5. Multigraphs. 1.6. Eigenvalue bounds for multigraphs. 1.7. Multigraph complements. 1.8. Two maximum tree results -- 2. Multigraphs with the maximum number of spanning Trees: An analytic approach. 2.1. The maximum spanning tree problem. 2.2. Two maximum spanning tree results -- 3. Threshold graphs. 3.1. Characteristic polynomials of threshold graphs. 3.2. Minimum number of spanning trees -- 4. Approaches to the multigraph problem -- 5. Laplacian integral graphs and multigraphs. 5.1. Complete graphs and related structures. 5.2. Split graphs and related structures. 5.3. Laplacian integral multigraphs.
요약주기
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.-- Source other than Library of Congress.
ISBN
9789814566032 9814566039
청구기호
511.5 G878s
소장정보
예도서예약
서서가에없는책 신고
보보존서고신청
캠캠퍼스대출
우우선정리신청
배자료배달신청
문문자발송
출청구기호출력
학소장학술지 원문서비스
등록번호 | 청구기호 | 소장처 | 도서상태 | 반납예정일 | 서비스 |
---|
북토크
자유롭게 책을 읽고
느낀점을 적어주세요
글쓰기
느낀점을 적어주세요
청구기호 브라우징
관련 인기대출 도서