Results 21 to 30 of about 728,663 (278)
C-m-SUPERMAGIC LABELING OF FRIENDSHIP GRAPHS
, 2021 The friendship graph Fmn is obtained by joining n copies of the cycle graph Cm with a common vertex. In this work, we investigate the Cm-supermagic labeling of friendship graphs.
Öner, Tarkan
openaire +2 more sources
Modular Coloring and Switching in Some Planar Graphs
Ratio Mathematica, 2023 For a connected graph G, let c: V (G) →ℤk (k ≥ 2) be a vertex coloring of G. The color sum \sigma(v) of a vertex v of G is defined as the sum in ℤk of the colors of the vertices in N (v) that is (v) = \sum_{u\inN(v)}{c(u)} (mod k).
G. R Sanma, P Maya
doaj +1 more source
Modular Irregular Labeling on Double-Star and Friendship Graphs
Journal of Mathematics, 2021 A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2,…,k such that the weights of all vertices are different.
K. A. Sugeng +3 more
doaj +1 more source
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
AKCE International Journal of Graphs and Combinatorics, 2023 The permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see text] where In ...
Aqib Khan +2 more
doaj +1 more source
On Antimagic Labeling for Some Families of Graphs
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2023 Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct.
Noor K. Shawkat, Mohammed A. Ahmed
doaj +1 more source
The friendship problem on graphs [PDF]
, 2016 In this paper we provide a purely combinatorial proof of the Friendship Theorem, which has been first proven by P. Erdős et al. by using also algebraic methods.
Unger, W., Mertzios, G.B.
core +3 more sources
A Unique Characterization of Spectral Extrema for Friendship Graphs
The Electronic Journal of Combinatorics, 2022 Turán-type problem is one of central problems in extremal graph theory. Erdős et al. [J. Combin. Theory Ser. B 64 (1995) 89-100] obtained the exact Turán number of the friendship graph $F_k$ for $n\geq 50k^2$, and characterized all its extremal graphs. Cioabă et al. [Electron. J. Combin.
Mingqing Zhai, Ruifang Liu, Jie Xue 0004
openaire +1 more source
Hasil Kali Matriks (Mod 2) pada Graf Roda, Graf Pertemanan dan Graf Bunga
Jambura Journal of Mathematics, 2021 ABSTRAK Pada artikel ini dibahas sifat-sifat hasil kali matriks (mod 2) terkait graf roda, graf pertemanan, dan graf bunga yang grafikal. Beberapa hasil yang diperoleh, A(Wn)A(Wn)(Mod 2) dan A(Wn)A(Sn)(Mod 2) grafikal apabila n=2k+1 dengan Sn merupakan ...
Fransiskus Fran +2 more
doaj +1 more source
Node-based generalized friendship paradox fails
Scientific Reports, 2023 The Friendship Paradox—the principle that “your friends have more friends than you do”—is a combinatorial fact about degrees in a graph; but given that many web-based social activities are correlated with a user’s degree, this fact has been taken more ...
Anna Evtushenko, Jon Kleinberg
doaj +1 more source
The Maximum Spectral Radius of Graphs Without Friendship Subgraphs [PDF]
The Electronic Journal of Combinatorics, 2020 A graph on $2k+1$ vertices consisting of $k$ triangles which intersect in exactly one common vertex is called a $k-$friendship graph and denoted by $F_k$. This paper determines the graphs of order $n$ that have the maximum (adjacency) spectral radius among all graphs containing no $F_k$, for $n$ sufficiently large.
Sebastian M. Cioaba +3 more
openaire +3 more sources