Graph Theory - Incidence Structure

---

---

Incidence Structure

Incidence Structure in graph theory refers to the relationship between vertices and edges in a graph. It describes how vertices are connected to edges, i.e., which edges are incident to which vertices.

The basic concept of incidence can be explained as follows −

• Vertex-Edge Incidence: A vertex is said to be incident to an edge if the edge connects that vertex with another vertex.
• Edge-Vertex Incidence: Similarly, an edge is incident to the vertices it connects.
• Relation Representation: The incidence structure is often represented using an incidence matrix or other compact forms that express these vertex-edge relationships efficiently.

Incidence Matrix

The incidence matrix is a binary matrix used to represent the incidence relationship between vertices and edges in a graph. In this matrix, rows represent vertices, and columns represent edges. Each entry in the matrix is either a 1 or 0, indicating whether a vertex is incident to an edge or not.

Incidence Matrix Calculation

Consider a simple undirected graph with vertices A, B, and C and edges A-B, A-C, and B-C. The incidence matrix for this graph is created by following these steps −

• Step 1: Assign index numbers to the vertices and edges.
• Step 2: For each edge, mark the corresponding vertices as incident by placing a 1 in the matrix.
• Step 3: For undirected edges, place a 1 in both the corresponding row and column for each vertex connected by that edge.

For the graph with vertices A (0), B (1), and C (2), and edges A-B (0), A-C (1), and B-C (2), the incidence matrix would be −

Incidence Matrix:
    Edge1  Edge2  Edge3
A   1      1      0
B   1      0      1
C   0      1      1

In this matrix −

• Vertex A: Incident to edges 1 and 2 (A-B and A-C).
• Vertex B: Incident to edges 1 and 3 (A-B and B-C).
• Vertex C: Incident to edges 2 and 3 (A-C and B-C).

Incidence Matrix for Directed Graphs

For directed graphs, the incidence matrix is adjusted to differentiate between incoming and outgoing edges. In this case, we represent edges with two values −

• -1: Indicates an outgoing edge from the vertex.
• 1: Indicates an incoming edge to the vertex.

For a directed graph where the edges are A B, B C, and A C, the incidence matrix would be −

Incidence Matrix:
    Edge1  Edge2  Edge3
A  -1      0      1
B   1     -1      0
C   0      1     -1

In this matrix:

• Vertex A: Has an outgoing edge to B (Edge 1) and an outgoing edge to C (Edge 3).
• Vertex B: Has an incoming edge from A (Edge 1) and an outgoing edge to C (Edge 2).
• Vertex C: Has an incoming edge from B (Edge 2) and an incoming edge from A (Edge 3).

Properties of Incidence Structures

Incidence structures has several major properties that are useful in graph analysis −

• Vertex Degree: The degree of a vertex can be calculated from its incidence relationship with edges. In an undirected graph, the degree is the number of edges incident to a vertex.
• Edge Count: The number of edges incident to a vertex is equal to the degree of that vertex.
• Incidence Matrix Sparsity: The incidence matrix for sparse graphs typically contains many zero entries, which allows for efficient storage and processing.
• Symmetry in Undirected Graphs: In an undirected graph, the incidence matrix is symmetric since every edge connects two vertices.

Incidence Structure in Hypergraphs

In a hypergraph, an edge (also called a hyperedge) can connect more than two vertices. The incidence structure for a hypergraph is an extension of the usual vertex-edge incidence structure, where each edge can be incident to a set of vertices instead of just two.

The incidence matrix for a hypergraph is similar to the one for regular graphs, except that each edge can now be associated with multiple vertices, and the entries of the matrix indicate the relationship between each hyperedge and the set of vertices it connects.

Incidence Structures: Advanced Techniques

Several advanced techniques can be applied to improve the efficiency of incidence structures −

• Matrix Compression: Incidence matrices can be compressed to reduce memory usage, especially for large sparse graphs.
• Incidence Graphs for Directed Acyclic Graphs (DAGs): Incidence structures can be extended to handle directed acyclic graphs, allowing for efficient representation and analysis of such graphs.
• Hypergraph Representation: Techniques like incidence matrices for hypergraphs allow for efficient representation and manipulation of hypergraph data in computational settings.

Applications of Incidence Structures

Incidence structures play an important role in various graph theory algorithms and real-world applications. Some of these applications are −

• Graph Traversal: Efficient traversal algorithms like Depth-First Search (DFS) and Breadth-First Search (BFS) can use incidence structures to explore the vertices and edges of a graph.
• Planarity Testing: Incidence structures can be used to test if a graph can be embedded in a plane without edges crossing, which is a key problem in graph theory.
• Network Analysis: In analyzing computer networks or transportation systems, incidence structures help determine the connectivity and paths between various nodes.
• Graph Coloring: In graph coloring algorithms, incidence matrices help determine the relationships between vertices and edges, ensuring that adjacent vertices get different colors.