🕸️On Graph Theory: On Edges (2000-2009)

"When the graph is embedded within a surface it is called a map. The nature of the surface needed to embed the graph without crossing edges is a topological feature, and the topological structure of this payoff space is not only useful, but also beautiful." (David Robinson & David Goforth, "The Topology of the 2×2 Games: A New Periodic Table", 2005)

"The Simplicial Approximation Theorem is a concise statement of the general result for functions between any two triangulated spaces. It says that on a suitable subdivision of the domain, any continuous function can be homotopically deformed by an arbitrarily small amount so that the modified function sends vertices to vertices and is linear on each edge, face, tetrahedron, and higher-dimensional cell of the triangulation." (Robert Messer & Philip Straffin, "Topology Now!", 2006)

"In modern terminology, a collection of points in space (called vertices) and lines (called edges) joining selected pairs of those points is called a graph, and the study of graphs is called graph theory. A graph that can be drawn on the plane so that the joining lines intersect only at vertices is called a planar graph." (David Gay, "Explorations in Topology", 2007) 

"The ingredients of a map - on sphere, a rectangle, or an island - are countries, borders, and vertices. A country is the interior of a polygon or distorted polygon. The countries of a map do not overlap. A border of the map is an edge of one or more of the country polygons. Two countries may meet along one of these borders. A vertex of the map is where two or more borders meet. The map is the union of all these elements." (David Gay, "Explorations in Topology", 2007)

"A graph in mathematics is a set of nodes and a set of edges between pairs of those nodes; the edges are ordered or nonordered pairs, or a relation, that defines the pairs of nodes for which the relation being examined is valid. […] The edges can either be undirected or directed; directed edges depict a relation that requires the nodes to be ordered while an undirected edge defines a relation in which no ordering of the edges is implied." (Dennis M Buede, "The Engineering Design of Systems: Models and methods", 2009)

🕸️On Graph Theory: On Edges (-1999)

 "A fuzzy cognitive map or FCM draws a causal picture. It ties facts and things and processes to values and policies and objectives. And it lets you predict how complex events interact and play out. [...] Neural nets give a shortcut to tuning an FCM. The trick is to let the fuzzy causal edges change as if they were synapses in a neural net. They cannot change with the same math laws because FCM edges stand for causal effect not signal flow. We bombard the FCM nodes with real data. The data state which nodes are on or off and to which degree at each moment in time. Then the edges grow among the nodes."  (Bart Kosko, "Fuzzy Thinking: The new science of fuzzy logic", 1993)

"The euler characteristic is strikingly easy to compute, and it really seems odd that it should be a topological invariant. After all, it is computed from a cell decomposition, and it is very easy to come up with a lot of different complexes on a single surface, all with varying numbers of faces, edges, and vertices. But somehow by taking the alternating sum, one arrives at a quantity which depends only on the underlying shape and not on the particular complex." (L Christine Kinsey. "Topology of Surfaces", 1993)

"The four-color map theorem is an assertion about graph theory, which is the study of discrete points and the lines that connect them; each point is called a vertex and each line is called an edge." (Alexander Humez et al, "Zero to Lazy Eight: The romance of numbers", 1993)

"Depth First Search is especially appropriate for threading mazes, because it is possible to use it without having a map of the maze. It involves only local rules at nodes, plus a record of nodes and edges already used, so you can explore the graph and traverse it as you go. The name indicates the basic idea: give top priority to pushing deeper into the maze. The number of steps required is at most twice the number of passages in the maze." (Ian Stewart, "The Magical Maze: Seeing the world through mathematical eyes", 1997) 

"One very effective approach is to represent all the possible actions as a maze, and try to find a route through it. It is a logical maze rather than a real one, touched with that magic genius of mathematical transformations in which a problem that seems unassailable in one form becomes trivial in another, logically equivalent one. The idea is to represent the problem in a visual manner, using a diagram called a graph. A graph consists of a number of nodes (dots) linked by edges (lines), possibly with arrows on them. Each 'state' of the puzzle - position of the items of produce relative to the river - is represented by a node. Each 'legal' move between states is represented as an edge joining the corresponding nodes. If necessary, arrows can be added to the edges to show which is the starting state and which is the end state. The solution of the puzzle then reduces to tracing a path through its graph, starting from the initial state of the problem and finishing at the desired final state. The graph is a kind of conceptual map of the puzzle - a maze of possible states whose passages are the edges of the graph and whose junctions are its nodes." (Ian Stewart, "The Magical Maze: Seeing the World Through Mathematical Eyes", 1997) 

"We wrote down all the states and legal moves (here it turned out to be helpful to have a systematic notation, but that's not essential). Then we formed a graph whose nodes correspond to states and whose edges correspond to legal moves. The solution of the puzzle is then a path through the graph that joins the start to the finish. Such a path is usually obvious to the eye, provided the puzzle is sufficiently simple for the entire graph to be drawn. Puzzles of this type are really mazes, for a maze is just a graph drawn in a slightly different fashion. Metaphorically, they are logical mazes - you have to find the right sequence of moves to solve them. The graph turns the logical maze into a genuine maze, turning the metaphor into reality. The fact that solving the real maze also solves the logical maze is one of the magical features of the maze that is mathematics." (Ian Stewart, "The Magical Maze: Seeing the World Through Mathematical Eyes", 1997) 

"The key to generating the small-world phenomenon is the presence of a small fraction of [...] edges, which contact otherwise distant parts of the graph" (Duncan J Watts, "Small Worlds: The Dynamics of Networks Between Order and Randomness", 1999)

🕸️On Graph Theory: On Edges (2010-2019)

"A feedback loop is a cycle in a directed graph whose edges can represent either positive or negative inputs." (Maria C A Leite & Yunjiao Wang, "Multistability, oscillations and bifurcations in feedback loops", Mathematical Biosciences and Engineering Vol 7 (1), 2010)

"First, what are the 'graphs' studied in graph theory? They are not graphs of functions as studied in calculus and analytic geometry. They are (usually finite) structures consisting of vertices and edges. As in geometry, we can think of vertices as points (but they are denoted by thick dots in diagrams) and of edges as arcs connecting pairs of distinct vertices. The positions of the vertices and the shapes of the edges are irrelevant: the graph is completely specified by saying which vertices are connected by edges. A common convention is that at most one edge connects a given pair of vertices, so a graph is essentially just a pair of sets: a set of objects." (John Stillwell, "Mathematics and Its History", 2010)

"[...] the contexts in which a social network is embedded will generally have significant effects on its structure. Each individual in a social network has a distinctive set of personal characteristics, and similarities and compatibilities between two people’s characteristics can strongly influence whether a link forms between them. Each individual also engages in a set of behaviors and activities that can shape the formation of links within the network. These considerations suggest what we mean by a network’s surrounding contexts: factors that exist outside the nodes and edges of a networks, but which nonetheless affect how the network’s structure evolves." (David Easley & Jon Kleinberg, "Networks, Crowds, and Markets: Reasoning about a Highly Connected World", 2010) 

"A network (or graph) consists of a set of nodes (or vertices, actors) and a set of edges (or links, ties) that connect those nodes. [...] The size of a network is characterized by the numbers of nodes and edges in it." (Hiroki Sayama, "Introduction to the Modeling and Analysis of Complex Systems", 2015)

"Discrete Mathematics is a branch of mathematics dealing with finite or countable processes and elements. Graph Theory is an area in Discrete Mathematics which studies configurations involving a set of vertices interconnected by edges (called graphs). From humble beginnings and almost recreational type problems, Graph Theory has found its calling in the modern world of complex systems and especially of the computer. Graph Theory and its applications can be found not only in other branches of mathematics, but also in scientific disciplines such as engineering, computer science, operational research, management sciences and the life sciences." (Khee Meng Koh et al, " Graph theory: Undergraduate mathematics", 2015)

"A network (or graph) consists of a set of nodes (or vertices, actors) and a set of edges (or links, ties) that connect those nodes. [...] The size of a network is characterized by the numbers of nodes and edges in it." (Hiroki Sayama, "Introduction to the Modeling and Analysis of Complex Systems", 2015)

"Our assumptions are unquestionably interconnected. They are nodes with connections (edges) to other nodes. The more foundational the assumption, the more strongly connected it is. What I’m suggesting is that our assumptions and the highly sensitive network of responses, perceptions, behaviors, thoughts, and ideas they create and interact with are a complex system. One of the most basic features of such a network is that when you move or disrupt one thing that is strongly connected, you don’t just affect that one thing, you affect all the other things that are connected to it. Hence small causes can have massive effects (but they don’t have to, and usually don’t actually). In a system of high tension, simple questions targeting basic assumptions have the potential to transform perception in radical  and unpredictable ways." (Beau Lotto, "Deviate: The Science of Seeing Differently", 2017) 

"Network theory confirms the view that information can take on 'a life of its own'. In the yeast network my colleagues found that 40 per cent of node pairs that are correlated via information transfer are not in fact physically connected; there is no direct chemical interaction. Conversely, about 35 per cent of node pairs transfer no information between them even though they are causally connected via a 'chemical wire' (edge). Patterns of information traversing the system may appear to be flowing down the 'wires' (along the edges of the graph) even when they are not. For some reason, 'correlation without causation' seems to be amplified in the biological case relative to random networks." (Paul Davies, "The Demon in the Machine: How Hidden Webs of Information Are Solving the Mystery of Life", 2019) 

"Node-link, matrix, and implicit representations are suited for different graph data. Node-link diagrams are good for sparse networks, which have a moderate number of edges. Dense networks with many edges are best visualized using a matrix. Trees, as we just said, are nicely represented by implicit approaches." (Christian Tominski & Heidrun Schumann, "Interactive Visual Data Analysis", 2019) 

"[...] the Game of Life, in which a few simple rules executed repeatedly can generate a surprising degree of complexity. Recall that the game treats squares, or pixels, as simply on or off (filled or blank) and the update rules are given in terms of the state of the nearest neighbours. The theory of networks is closely analogous. An electrical network, for example, consists of a collection of switches with wires connecting them. Switches can be on or off, and simple rules determine whether a given switch is flipped, according to the signals coming down the wires from the neighbouring switches. The whole network, which is easy to model on a computer, can be put in a specific starting state and then updated step by step, just like a cellular automaton. The ensuing patterns of activity depend both on the wiring diagram (the topology of the network) and the starting state. The theory of networks can be developed quite generally as a mathematical exercise: the switches are called ‘nodes’ and the wires are called ‘edges’. From very simple network rules, rich and complex activity can follow." (Paul Davies, "The Demon in the Machine: How Hidden Webs of Information Are Solving the Mystery of Life", 2019) 

🕸️On Graph Theory: On Edges (2020-2029)

"A graph is a simple and quite old mathematical concept: a data structure consisting of a set of vertices (or nodes/points) and edges (or relationships/lines) that can be used to model relationships among a collection of objects." (Alessandro Negro, "Graph-Powered Machine Learning", 2021)

"Graphs are useful for representing how things are either physically or logically linked in simple or complex structures. A graph in which we assign names and meanings to the edges and vertices becomes what is known as a network. In these cases, a graph is the mathematical model for describing a network, whereas a network is a set of relations between objects, which could include people, organizations, nations, items found in a Google search, brain cells, or electrical transformers." (Alessandro Negro, "Graph-Powered Machine Learning", 2021)

"Several areas of graph theory are concerned with the likelihood or certainty of the presence in a graph of various subgraphs or, more generally, of graph properties that emerge as the number of vertices and/or the number of edges increases. Collectively they are grouped as analytic graph theory." (Jonathan L Gross et al, "Topics in Graph Theory", 2023)

"Some connected graphs are 'more connected' than others. That is, a connected graph’s vulnerability to disconnection by edge- or vertex-deletion varies. Two numerical parameters, vertex-connectivity and edge-connectivity, are useful in measuring a graph’s connectedness. Intuitively, a network’s vulnerability should be closely related also to the number of  alternative paths between each pair of nodes. There is a rich body of mathematical results concerning this relationship, many of which are variations of a classical result of Menger, and some of these extend well beyond graph theory." (Jonathan L Gross et al, "Topics in Graph Theory", 2023)

"Spanning trees capture the connectedness of a graph in the most efficient way, and they provide a foundation for a systematic analysis of the cycle structure of a graph. Mathematicians regard the algebraic structures underlying the collection of cycles and edge-cuts of agraph as beautiful in their own right. Establishing connections between linear algebra and graph theory provides some powerful analytical tools for understanding a graph’s structure." (Jonathan L Gross et al, "Topics in Graph Theory", 2023) 

"The concept of temporal graphs is useful in all the real-world problems that can be represented as a graph, where the nodes and edges of the graph may change over time. For example, temporal graphs are extensively applied in modeling social networks. By capturing the evolving relationships between individuals, temporal graphs enable a more accurate representation of social dynamics. This is particularly useful for predicting changes in friendships, community structures, and the information diffusion over time." (Aldo Marzullo et al, "Graph Machine Learning" 2nd Ed., 2025) 

"Hierarchical clustering is summarised by a dendrogram, which sequentially shows points being joined to form a cluster, with the corresponding distances. Breaking the data into clusters is done by cutting the dendrogram at the long edges. [...] Plotting the dendrogram in the data space can help you understand how the hierarchical clustering has collected the points together into clusters. You can learn if the algorithm has been confused by nuisance patterns in the data, and how different choices of linkage method affect the result." (Dianne Cook & Ursula Laa, "Interactively Exploring High-Dimensional Data and Models in R", 2026)

"Viewing the dendrograms in high dimensions provides insight into how the algorithm has joined points to clusters. For example, single linkage often has edges leading to a single focal point, which might not yield a useful clustering but might help to identify outliers. If the edges point to multiple focal points, with long edges bridging gaps in the data, the result is more likely yielding a useful clustering." (Dianne Cook & Ursula Laa,  "Interactively Exploring High-Dimensional Data and Models in R", 2026)