logo

Graph Theory
  • Preface

Main Contents

  • 1. Basic Concepts of Graphs
    • 1.1. Isomorphism
    • 1.2. Vertex Degrees
    • 1.3. Graph Realization Problem
    • 1.4. Paths and Connection
    • 1.5. Cycles
    • 1.6. Shortest Paths and Dijkstra’s Algorithm
  • 2. Trees
    • 2.1. Definition of Trees

Appendix

  • References
  • Index
Powered by Jupyter Book
  • repository
  • open issue

Index

Index

A | C | D | F | G | H | I | L | O | P | R | T | W

A

  • acyclic graphs

C

  • complete bipartite graph
  • connected and disconnected vertices
  • cut edge

D

  • degree sequence

F

  • free tree

G

  • girth
  • graph realization problem
  • graphical degree sequence

H

  • Havel-Hakimi theorem

I

  • isomorphism

L

  • leaf

O

  • origin of a walk

P

  • path in a graph

R

  • root of a tree
  • rooted tree

T

  • terminus of a walk
  • trail in a graph
  • tree
  • trivial walk

W

  • walk in a graph
  • weight of an edge

By Isaac FEI
© Copyright 2022.