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)

Related topics

Related topics

9 relations
Butterfly graphChromatic polynomialEdge-graceful labelingExtremal graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
SOME ADRIATIC INDICES OF DUTCH WINDMILL GRAPH USING GRAPH OPERATOR
2018
2018
Generic anomalous vertices detection utilizing a link prediction algorithm
In the past decade, graph-based structures have penetrated nearly every aspect of our lives. The detection of anomalies in these… 
2018
2018
THE HOSOYA, SCHULTZ AND MODIFIED SCHULTZ POLYNOMIALS OF A CLASS OF DUTCH WINDMILL GRAPH D(m)n, ∀ n,m ∈ N & n ≥ 4, m ≥ 2
It’s shown by a large number of studies that strong inner bound exists between the chemical characteristics of nano structures… 
2014
2014
Note on Distance Magic Products $$G\circ C_4$$G∘C4
A distance magic labeling of a graph $$G=(V,E)$$G=(V,E) of order $$n$$n is a bijection $$l :V \rightarrow \{1, 2,\ldots , n\}$$l… 
2011
2011
Conditional and Unique Coloring of Graphs
For integers k > 0 and 0 < r ≤ � (where r ≤ k), a conditional (k,r)-coloring of a graph G is a proper k-coloring of the vertices… 
2010
2010
Analyzing the Facebook Friendship Graph
Online Social Networks (OSN) during last years acquired a huge and increasing popularity as one of the most important emerging… 
2009
2009
Camera brand congruence in the Flickr social graph
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
Invited Talks Symmetry , Hadwiger number , pointwise limit of graphs
A vertex k-coloring of a graph G is distinguishing if the only automorphism of G that preserves the colors is the identity map… 
2000
2000
Symmetric Graph Designs
Abstract. We introduce the notion of a symmetric graph design which is a common generalization of symmetric BIBDs and of… 
1978
1978
A generalization of the friendship theorem
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)