Live briefing
Everything about Friendship graph
Graph of triangles with a shared vertex
In the mathematical field of graph theory, the friendship graph Fn is a planar, undirected graph with 2n + 1 vertices and 3n edges. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Friendship graphA 5-minute orientation
- Skim a recent paper: Dual Subgraph-Based Graph Neural Network for Friendship Prediction in Location-Based Social NetworksInfluential work since 2022
- Pick up a classic book: Winsor McCayThe most-reprinted book on the subject
- Read the landmark paper: Enhancing session-based social recommendation through item graph embedding and contextual friendship modelingCited 53 times
- Go sideways: Windmill graphA closely related topic
- Go sideways: Critical graphA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Enhancing session-based social recommendation through item graph embedding and contextual friendship modeling
A sum labelling for the generalised friendship graph
Spectral Extrema of Graphs With Fixed Size: Forbidden a Fan Graph, a Friendship Graph, or a Theta Graph
Intelligent cluster connectionist recommender system using implicit graph friendship algorithm for social networks
On the local metric dimension of a lollipop graph, a web graph, and a friendship graph
Graphic sequences with a realization containing a generalized friendship graph
Degrees of Vertices in a Friendship Graph
Symmetric graph designs on friendship graphs
🆕 Influential since 2022
Dual Subgraph-Based Graph Neural Network for Friendship Prediction in Location-Based Social Networks
Federated learning enabled graph convolutional autoencoder and factorization machine for potential friendship prediction in social networks
Group vertex magicness of H-join and generalised friendship graph
Trajectory- and Friendship-Aware Graph Neural Network with Transformer for Next POI Recommendation
Some New Topological Indices of Friendship Graph
đź“š Books worth reading
Winsor McCayWinsor McCay · 2003- 📕Graph Paper NotebookWriteDrawDesign · 2018
- 📕Exponential random graph models for social networksDean Lusher, Johan Koskinen · 2012
Security Protocols XVIIBruce Christianson · 2013
Exploratory social network analysis with PajekWouter de Nooy · 2011
Maths in 100 key breakthroughsRichard Elwes · 2013- 📕Chopin 1810-2010Irena Poniatowska, Zofia Chechlińska · 2017
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Windmill graph In the mathematical field of graph theory, the windmill graph Wd(k,n) is an undirected graph constructed for k ≥ 2 and n ≥ 2 by joining n copies of the…
- Critical graph In graph theory, a critical graph is an undirected graph all of whose proper subgraphs have smaller chromatic number. In such a graph, every vertex or…
- De Bruijn–Erdős theorem (graph theory) In graph theory, the De Bruijn–Erdős theorem relates graph coloring of an infinite graph to the same problem on its finite subgraphs. It states that, when…
- 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…
- Erdős–Faber–Lovász conjecture Unsolved problem in mathematics Conjecture: If k complete graphs, each having exactly k vertices, have the property that every pair of complete graphs…
- Grötzsch graph In the mathematical field of graph theory, the Grötzsch graph is a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number…
- Forbidden subgraph problem In extremal graph theory, the forbidden subgraph problem is the following problem: given a graph G {\displaystyle G} , find the maximal number of edges…
- 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…