Results 1 to 10 of about 4,787 (279)
Laplacian spectral determination of path-friendship graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 A graph G is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to G. In some recent papers it is proved that the friendship graphs and starlike trees are DLS. If a friendship graph and
Mohammad Reza Oboudi +3 more
doaj +6 more sources
Interlace polynomials of friendship graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2018 In this paper, we study the interlace polynomials of friendship graphs, that is, graphs that satisfy the Friendship Theorem given by Erdös, Rényi and Sos.
Christina Eubanks-Turner, Aihua Li
doaj +5 more sources
Connected graphs cospectral with a Friendship graph [PDF]
Transactions on Combinatorics, 2014 Let $n$ be any positive integer, the friendship graph $F_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. A graph $G$ is called cospectral with a graph $H$ if their adjacency matrices have the same eigenvalues.
Alireza Abdollahi , Shahrooz Janbaz
doaj +6 more sources
Graphs cospectral with a friendship graph or its complement [PDF]
Transactions on Combinatorics, 2013 Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$.
Alireza Abdollahi +2 more
doaj +5 more sources
A sum labelling for the generalised friendship graph [PDF]
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Fernau
exaly +4 more sources
Graphic sequences with a realization containing a generalized friendship graph [PDF]
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John R Schmitt
exaly +3 more sources
On Strongly Regular Graphs and the Friendship Theorem [PDF]
MathematicsThis paper presents an alternative proof of the celebrated friendship theorem, originally established by Erdős, Rényi, and Sós in 1966. The proof relies on a closed-form expression for the Lovász ϑ-function of strongly regular graphs, recently derived by
Igal Sason
doaj +4 more sources
On Topological Indices of Subdivided and Line Graph of Subdivided Friendship Graph [PDF]
International Journal of Discrete Mathematics, 2019 Topological indices are numerical parameters which characterizes the topology of a molecular graph, they corelate certain physo-chemical properties and importantly they are structure invariant. Degree based topological indices play vital role among others.
Zeeshan Saleem Mufti
exaly +2 more sources
Super (a, d)-edge antimagic total labelings of friendship and generalized friendship graphs
Electronic Notes in Discrete Mathematics, 2015 Abstract An (a, d)-edge-antimagic total labeling of a graph G with p vertices and q edges is a bijection f from the set of all vertices and edges to the set of positive integers { 1 , 2 , 3 , … , p + q } such that all the edge-weights w ( u v ) = f ( u ) + f ( v ) + f ( u v ) ; u v ∈ E ( G ...
Subramanian Arumugam
exaly +2 more sources
On Edge Irregular Reflexive Labellings for the Generalized Friendship Graphs [PDF]
Mathematics, 2017 We study an edge irregular reflexive k-labelling for the generalized friendship graphs, also known as flowers (a symmetric collection of cycles meeting at a common vertex), and determine the exact value of the reflexive edge strength for several subfamilies of the generalized friendship graphs.
Martin Baca +2 more
exaly +4 more sources