Graphs and matrices:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
London [u.a.]
Springer [u.a.]
2014
|
Ausgabe: | 2. ed. |
Schriftenreihe: | Universitext
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis Klappentext |
Beschreibung: | XI, 193 S. graph. Darst. |
ISBN: | 9781447165682 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV042167419 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 141104s2014 d||| |||| 00||| eng d | ||
020 | |a 9781447165682 |9 978-1-4471-6568-2 | ||
035 | |a (OCoLC)894735488 | ||
035 | |a (DE-599)BVBBV042167419 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-11 |a DE-355 |a DE-29T |a DE-188 | ||
082 | 0 | |a 511.5 |2 22 | |
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
084 | |a MAT 055f |2 stub | ||
084 | |a MAT 150f |2 stub | ||
084 | |a 510 |2 sdnb | ||
100 | 1 | |a Bapat, Ravi B. |e Verfasser |0 (DE-588)115635831 |4 aut | |
245 | 1 | 0 | |a Graphs and matrices |c Ravindra B. Bapat |
250 | |a 2. ed. | ||
264 | 1 | |a London [u.a.] |b Springer [u.a.] |c 2014 | |
300 | |a XI, 193 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Universitext | |
650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
689 | 0 | |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-1-4471-6569-9 |
856 | 4 | 2 | |m Digitalisierung UB Regensburg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027606928&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
856 | 4 | 2 | |m Digitalisierung UB Regensburg - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027606928&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |3 Klappentext |
999 | |a oai:aleph.bib-bvb.de:BVB01-027606928 |
Datensatz im Suchindex
_version_ | 1804152668726231040 |
---|---|
adam_text | Contents
1
Preliminaries
....................................... 1
1.1
Matrices
...................................... 1
1.2
Eigenvalues of Symmetric Matrices
.................... 5
1.3
Generalized Inverses
.............................. 8
1.4
Graphs
....................................... 10
References and Further Reading
........................... 11
2
Incidence Matrix
.................................... 13
2.1
Rank
......................................... 14
2.2
Minors
....................................... 15
2.3
Path Matrix
.................................... 17
2.4
Integer Generalized Inverses
......................... 18
2.5
Moore-Penrose Inverse
............................ 20
2.6 0-1
Incidence Matrix
............................. 22
2.7
Matchings in Bipartite Graphs
....................... 23
References and Further Reading
........................... 25
3
Adjacency Matrix
.................................... 27
3.1
Eigenvalues of Some Graphs
........................ 28
3.2
Determinant
.................................... 30
3.3
Bounds
....................................... 33
3.4
Energy of a Graph
............................... 38
3.5
Antiadjacency Matrix of a Directed Graph
............... 40
3.6
Nonsingular Trees
................................ 42
References and Further Readings
.......................... 48
4
Laplacian Matrix
.................................... 49
4.1
Basic Properties
................................. 50
4.2
Computing Laplacian Eigenvalues
..................... 51
4.3
Matrix-Tree Theorem
............................. 52
к
Contents
4.4
Bounds for Laplacian Spectral Radius
.................. 54
4.5
Edge-Laplacian of a Tree
........................... 55
References and Further Reading
........................... 59
5
Cycles and Cuts
..................................... 61
5.1
Fundamental Cycles and Fundamental Cuts
.............. 61
5.2
Fundamental Matrices
............................. 63
5.3
Minors
....................................... 64
References and Further Reading
........................... 68
6
Regular Graphs
..................................... 69
6.1
Perron-Frobenius Theory
........................... 69
6.2
Adjacency Algebra of a Regular Graph
................. 74
6.3
Complement and Line Graph of a Regular Graph
.......... 75
6.4
Strongly Regular Graphs and Friendship Theorem
......... 78
6.5
Graphs with Maximum Energy
....................... 81
References and Further Reading
........................... 85
7
Line Graph of a Tree
................................. 87
7.1
Block Graphs
................................... 87
7.2
Signless Laplacian Matrix
.......................... 93
7.3
Nullity of the Line Graph of a Tree
................... 95
References and Further Reading
........................... 99
8
Algebraic Connectivity
................................ 101
8.1
Preliminary Results
............................... 101
8.2
Classification of Trees
............................. 103
8.3
Monotonicity
Properties of Fiedler Vector
............... 108
8.4
Bounds for Algebraic Connectivity
....................
HO
References and Further Reading
........................... 114
9
Distance Matrix of a Tree
.............................. 115
9.1
Distance Matrix of a Graph
......................... 117
9.2
Distance Matrix and Laplacian of a Tree
................ 120
9.3
Eigenvalues of the Distance Matrix of a Tree
............. 125
References and Further Reading
........................... 130
10
Resistance Distance
................................... 131
10.1
The Triangle Inequality
............................ 132
10.2
Network Flows
.................................. 134
10.3
A Random Walk on Graphs
......................... 137
10.4
Effective Resistance in Electrical Networks
.............. 138
10.5
Resistance Matrix
................................ 139
References and Further Reading
........................... 144
Contents xi
11 Laplacian
Eigenvalues of Threshold Graphs
................ 145
11.1
Majorization
.................................... 145
11.2
Threshold Graphs
................................ 149
11.3
Spectral Integral Variation
.......................... 151
References and Further Reading
........................... 155
12
Positive Definite Completion Problem
..................... 157
12.1
Nonsingular Completion
........................... 157
12.2
Chordal Graphs
................................. 158
12.3
Positive Definite Completion
........................ 160
References and Further Reading
........................... 164
13
Matrix Games Based on Graphs
......................... 165
13.1
Matrix Games
.................................. 165
13.2
Vertex Selection Games
............................ 167
13.3
Tournament Games
............................... 169
13.4
Incidence Matrix Games
........................... 171
References and Further Reading
........................... 177
Hints and Solutions to Selected Exercises
...................... 179
Bibliography
........................................... 187
Index
................................................ 191
Universitext
Ravindra
В.
Bapaî
Graphs and Matrices
SecondEdition
This new edition illustrates the power of linear algebra in the study of graphs. The
emphasis on matrix techniques is greater than in other texts on algebraic graph theory.
Important matrices associated with graphs (for example, incidence, adjacency and
Laplacian matrices) are treated in detail.
Presenting a useful overview of selected topics in algebraic graph theory, early chapters
of the text focus on regular graphs, algebraic connectivity, the distance matrix of a
tree, and its generalized version for arbitrary graphs, known as the resistance matrix.
Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive
definite completion problem and matrix games based on a graph.
Such an extensive coverage of the subject area provides a welcome prompt for further
exploration. The inclusion of exercises enables practical learning throughout the book.
In the new edition, a new chapter is added on the line graph of a tree, while some
results in Chapter
6
on Perron-Frobenius theory are reorganized.
Whilst this book will be invaluable to students and researchers in graph theory and
combinatorial matrix theory, it will also benefit readers in the sciences and engineering.
|
any_adam_object | 1 |
author | Bapat, Ravi B. |
author_GND | (DE-588)115635831 |
author_facet | Bapat, Ravi B. |
author_role | aut |
author_sort | Bapat, Ravi B. |
author_variant | r b b rb rbb |
building | Verbundindex |
bvnumber | BV042167419 |
classification_rvk | SK 890 |
classification_tum | MAT 055f MAT 150f |
ctrlnum | (OCoLC)894735488 (DE-599)BVBBV042167419 |
dewey-full | 511.5 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.5 |
dewey-search | 511.5 |
dewey-sort | 3511.5 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
edition | 2. ed. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01731nam a2200409 c 4500</leader><controlfield tag="001">BV042167419</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">141104s2014 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781447165682</subfield><subfield code="9">978-1-4471-6568-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)894735488</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042167419</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 150f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bapat, Ravi B.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)115635831</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graphs and matrices</subfield><subfield code="c">Ravindra B. Bapat</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London [u.a.]</subfield><subfield code="b">Springer [u.a.]</subfield><subfield code="c">2014</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 193 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Universitext</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-1-4471-6569-9</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Regensburg - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027606928&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Regensburg - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027606928&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Klappentext</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027606928</subfield></datafield></record></collection> |
id | DE-604.BV042167419 |
illustrated | Illustrated |
indexdate | 2024-07-10T01:14:22Z |
institution | BVB |
isbn | 9781447165682 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027606928 |
oclc_num | 894735488 |
open_access_boolean | |
owner | DE-11 DE-355 DE-BY-UBR DE-29T DE-188 |
owner_facet | DE-11 DE-355 DE-BY-UBR DE-29T DE-188 |
physical | XI, 193 S. graph. Darst. |
publishDate | 2014 |
publishDateSearch | 2014 |
publishDateSort | 2014 |
publisher | Springer [u.a.] |
record_format | marc |
series2 | Universitext |
spelling | Bapat, Ravi B. Verfasser (DE-588)115635831 aut Graphs and matrices Ravindra B. Bapat 2. ed. London [u.a.] Springer [u.a.] 2014 XI, 193 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Universitext Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s DE-604 Erscheint auch als Online-Ausgabe 978-1-4471-6569-9 Digitalisierung UB Regensburg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027606928&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Digitalisierung UB Regensburg - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027606928&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Klappentext |
spellingShingle | Bapat, Ravi B. Graphs and matrices Graphentheorie (DE-588)4113782-6 gnd |
subject_GND | (DE-588)4113782-6 |
title | Graphs and matrices |
title_auth | Graphs and matrices |
title_exact_search | Graphs and matrices |
title_full | Graphs and matrices Ravindra B. Bapat |
title_fullStr | Graphs and matrices Ravindra B. Bapat |
title_full_unstemmed | Graphs and matrices Ravindra B. Bapat |
title_short | Graphs and matrices |
title_sort | graphs and matrices |
topic | Graphentheorie (DE-588)4113782-6 gnd |
topic_facet | Graphentheorie |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027606928&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=027606928&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT bapatravib graphsandmatrices |