Skip to search formSkip to main contentSkip to account menu

Friendship graph

Known as: Dutch windmill graph, Friendship theorem, N-fan 
In the mathematical field of graph theory, the friendship graph (or Dutch windmill graph or n-fan) Fn is a planar undirected graph with 2n+1 vertices… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
It’s shown by a large number of studies that strong inner bound exists between the chemical characteristics of nano structures… 
2011
2011
Let G be a graph with a set of vertices and a set of edges Then the distance from vertex u to vertex v in G, denoted by is the… 
2010
2010
Online Social Networks (OSN) during last years acquired a huge and increasing popularity as one of the most important emerging… 
2009
2009
Given that my friends on Flickr use cameras of brand X, am I more likely to also use a camera of brand X? Given that one of these… 
Review
2008
Review
2008
A vertex k-coloring of a graph G is distinguishing if the only automorphism of G that preserves the colors is the identity map… 
2005
2005
We propose a generalization of Halls marriage theorem. The generalization given here provides a necessary sufficient condition… 
1980
1980
Several proofs of the friendship theorem are known. In this paper an alternative proof will be given for friendship theorem. The…