Interval Graph Calculator Math
'/%3E%3Ccircle cx='48' cy='39' r='19' fill='%23f2c9a5'/%3E%3Cpath d='M27 35c3-16 39-17 42 2-8-8-27-9-42-2z' fill='%23374151'/%3E%3Cpath d='M21 86c5-24 49-28 56 0z' fill='%232563eb'/%3E%3Ccircle cx='41' cy='41' r='2' fill='%23111827'/%3E%3Ccircle cx='55' cy='41' r='2' fill='%23111827'/%3E%3Cpath d='M42 52c4 3 9 3 13 0' stroke='%2392400e' stroke-width='3' fill='none' stroke-linecap='round'/%3E%3C/svg%3E)
Reviewed by Calculator Editorial Team
An interval graph is a type of graph that can be represented as a set of intervals on the real line, where each vertex corresponds to an interval and edges connect vertices whose intervals overlap. This calculator helps you create, visualize, and analyze interval graphs in mathematics.
What is an Interval Graph?
An interval graph is a special type of graph that can be represented as a set of intervals on the real number line. Each vertex in the graph corresponds to an interval, and an edge connects two vertices if and only if their corresponding intervals overlap.
Key Properties
- Interval graphs are perfect graphs
- They have a perfect elimination ordering
- They can be recognized in linear time
- They have a maximum clique size equal to their chromatic number
Applications
Interval graphs have applications in various fields including:
- Scheduling problems
- Bioinformatics
- Computer science algorithms
- Network analysis
- Resource allocation problems
How to Use This Calculator
Our interval graph calculator allows you to:
- Input your intervals in the format [start, end]
- Visualize the graph representation
- Analyze graph properties
- Generate the adjacency matrix
- Export the graph data
Input Format
Enter intervals as comma-separated pairs of numbers. For example: "1,5; 3,7; 6,9" represents three intervals: [1,5], [3,7], and [6,9].
Formula
The interval graph is constructed by creating a vertex for each interval and connecting two vertices with an edge if their intervals overlap.
Overlap Condition
Two intervals [a,b] and [c,d] overlap if and only if a ≤ d and c ≤ b.
Graph Properties
The resulting graph will have:
- n vertices (where n is the number of intervals)
- m edges (where m is the number of overlapping interval pairs)
- Maximum degree equal to the maximum number of overlaps for any single interval
Examples
Example 1: Simple Interval Graph
Input intervals: [1,5], [3,7], [6,9]
This creates a graph with 3 vertices and 2 edges (between [1,5]-[3,7] and [3,7]-[6,9]).
Example 2: Non-Overlapping Intervals
Input intervals: [1,3], [4,6], [7,9]
This creates a graph with 3 vertices and 0 edges since no intervals overlap.
Example 3: Complete Graph
Input intervals: [1,5], [2,4], [3,6]
This creates a complete graph with 3 vertices and 3 edges since all intervals overlap with each other.
| Interval Set | Vertices | Edges | Graph Type |
|---|---|---|---|
| [1,5], [3,7], [6,9] | 3 | 2 | Simple interval graph |
| [1,3], [4,6], [7,9] | 3 | 0 | Empty graph |
| [1,5], [2,4], [3,6] | 3 | 3 | Complete graph |
FAQ
What is the difference between an interval graph and a general graph?
An interval graph is a special type of graph that can be represented as a set of intervals on the real line, where edges connect overlapping intervals. General graphs can represent any type of relationship and don't have this specific interval representation.
How can I recognize if a graph is an interval graph?
A graph is an interval graph if and only if it has a perfect elimination ordering. This means you can order the vertices such that for each vertex, its neighbors that come after it in the ordering form a clique.
What are some practical applications of interval graphs?
Interval graphs are used in scheduling problems, bioinformatics, computer science algorithms, network analysis, and resource allocation problems where tasks or events can be represented as intervals.