Miscellaneous Graph Properties
- 6 Degrees of Separation Phenomenon
- Adjacency List
- Algebraic Connectivity
- All-Pairs Shortest Path
- All-to-All Communication
- Apollonian Network
- Arc-Transitive Graph
- Articulation Vertex
- Berge's Theorem
- Block
- Bold Conjecture
- Bridged Graph
- Bridgeless Graph
- Canonical Labeling
- Central Point
- Centroid Point
- Characteristic Polynomial
- Chromatically Unique Graph
- Connected Component
- Connectivity Pair
- Cospectral Graphs
- Degree Set
- Determined by Chromatic Polynomial
- Edge Count
- Edge-Induced Subgraph
- Edge Set
- Ego-Centered Graph
- Ego-Centered Network
- Ego Graph
- Endpoint
- Even Vertex
- External Path Length
- Fiedler Vector
- Fork
- Frucht's Theorem
- Fully Reconstructible Graph
- Generically Globally Rigid
- Geodetic Number
- Global Parameters
- Gossip Problem
- Gossiping
- Graph Arc
- Graph Automorphism
- Graph Center
- Graph Circumference
- Graph Coarseness
- Graph Diameter
- Graph Distance
- Graph Eccentricity
- Graph Eigenvalue
- Graph Genus
- Graph Geodesic
- Graph Neighborhood
- Graph Order
- Graph Periphery
- Graph Radius
- Graph Resistance
- Graph Skewness
- Graph Spectrum
- Graph Thickness
- Graph Triameter
- Graphic Matroid
- Graphical Partition
- Hajós Number
- Hall's Condition
- Hamming Distance
- Hull Number
- Independent Vertex Set
- Integral Graph
- Internal Path Length
- Intersection Array
- Intersection Number
- Isolated Point
- Isomorphic Graphs
- Isospectral Graphs
- k-Factor
- k-Point Connected
- k-Point Connected Graph
- k-Vertex Connected
- k-Vertex Connected Graph
- LCF Notation
- Loop
- Matching Number
- Maximum Degree
- Minimum Degree
- Minimum Edge Cover
- Minimum Vertex Cover
- Neighborhood
- Neighborhood Complex
- Neighborhood Graph
- Nonadjacent Vertex Pairs
- Nonhamiltonian Vertex-Transitive Graph
- Odd Vertex
- Ordered Pairs Representation
- Perfect Graph Theorem
- Peripheral Point
- Phase Transition
- Reaching Algorithm
- Route
- s-Route
- Shannon Capacity
- Shortest Path Problem
- Shortest-Path Spanning Tree
- Shortness Exponent
- Sigma Polynomial
- Six Degrees of Separation Phenomenon
- Spectrally Unique
- Steinitz's Theorem
- Strong Perfect Graph Theorem
- Tree Centroid
- Tutte Conjecture
- Tutte's Wheel Theorem
- Ulam's Conjecture
- Unordered Pairs Representation
- Vertex Count
- Vertex Degree
- Vertex Number
- Vertex Set
- Vertex-Transitive Graph
- Vizing Conjecture