Results 1 to 10 of about 2,715 (247)
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 +4 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 ...
Martin Bača +4 more
doaj +5 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 +2 more sources
The eccentricity spread of weak-friendship graphs [PDF]
Discrete Mathematics Letters, 2023 Summary: A weak-friendship graph is a connected induced subgraph of a friendship graph. The unique graphs attaining the first two smallest eccentricity spread in the class of weak-friendship graphs of given order are determined in this paper.
Xuanshi Jia +2 more
doaj +3 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 +4 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 +3 more sources
Friendship decompositions of graphs
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
TERESA Sousa
exaly +2 more sources
Distance-based topological polynomials and indices of friendship graphs. [PDF]
Springerplus, 2016 Drugs and chemical compounds are often modeled as graphs in which the each vertex of the graph expresses an atom of molecule and covalent bounds between atoms are represented by the edges between their corresponding vertices. The topological indicators defined over this molecular graph have been shown to be strongly correlated to various chemical ...
Gao W +3 more
europepmc +4 more sources
On irregularity strength of disjoint union of friendship graphs
Electronic Journal of Graph Theory and Applications, 2013 We investigate the vertex total and edge total modication of the well-known irregularity strength of graphs. We have determined the exact values of the total vertex irregularity strength and the total edge irregularity strength of a disjoint union of ...
Ali Ahmad, Martin Baca, Muhammad Numan
doaj +3 more sources
On the domination polynomials of friendship graphs
Filomat, 2016 Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x)= n?i=0 d(G,i)xi, where d(G,i) is the number of dominating sets of G of size i. Let n be any positive integer and Fn be the Friendship graph with 2n + 1 vertices and 3n edges, formed by the join of K1 with nK2.
Saeid Alikhani +2 more
exaly +4 more sources