Live briefing
Everything about Graph power
Graph of short distances in another graph
In graph theory, a branch of mathematics, the kth power Gk of an undirected graph G is another graph that has the same set of vertices, but in which two vertices are adjacent when their distance in G is at most k. Powers of graphs are referred to using terminology similar to that of exponentiation of numbers: G2 is called the square of G, G3 is called the cube of G, etc. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Graph powerA 5-minute orientation
- Skim a recent paper: Graph pangenome captures missing heritability and empowers tomato breedingInfluential work since 2022
- Pick up a classic book: Building an energy demand signed digraphThe most-reprinted book on the subject
- Read the landmark paper: The power graph of a finite groupCited 168 times
- Go sideways: Edge coloringA closely related topic
- Go sideways: Greedy coloringA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The power graph of a finite group
Unraveling Protein Networks with Power Graph Analysis
Bond graph modeling of automotive power trains
Graph-Theoretic Analysis of Power Systems
On the Structure of the Power Graph and the Enhanced Power Graph of a Group
On the power graph of a finite group
Power System Network Topology Identification Based on Knowledge Graph and Graph Neural Network
Harsanyi power solutions for graph-restricted games
🆕 Influential since 2022
Graph pangenome captures missing heritability and empowers tomato breeding
From Graph Theory to Graph Neural Networks (GNNs): The Opportunities of GNNs in Power Electronics
Power Flow Balancing With Decentralized Graph Neural Networks
Power flow analysis via typed graph neural networks
Power Distribution Network Topology Detection Using Dual-Graph Structure Graph Neural Network Model
📚 Books worth reading
- 📕Building an energy demand signed digraphFred S. Roberts · 1972
- 📕A new graph-theoretical scheme for coordination of protection systemsS. M. Madni Abbasi · 1998
- 📕Power systems applications of graph theoryJizhong Zhu · 2009
CalculusRobert T. Smith · 2012- 📕Microcomputer applications of, and modifications to, the modular fault trees · 1994
- 📕Microcomputer applications of, and modifications to, the modular fault trees · 1994
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Edge coloring In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color…
- Greedy coloring In the study of graph coloring problems in mathematics and computer science, a greedy coloring or sequential coloring is a coloring of the vertices of…
- Grundy number In graph theory, the Grundy number or Grundy chromatic number of an undirected graph is the largest number of colors in any greedy coloring of the graph…
- Graph coloring In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain…
- Halin graph In graph theory, a Halin graph is a type of planar graph, constructed by connecting the leaves of a tree into a cycle. The tree must have at least four…
- Star coloring In the mathematical field of graph theory, a star coloring of a graph G is a (proper) vertex coloring in which every path on four vertices uses at least…
- Equitable coloring In graph theory, an area of mathematics, an equitable coloring is an assignment of colors to the vertices of an undirected graph, in such a way that No…
- Degeneracy (graph theory) In graph theory, a k-degenerate graph is an undirected graph in which every non-empty subgraph has at least one vertex of degree at most k. That is, some…