Results 21 to 30 of about 4,787 (279)
Journal of Statistical Software, 2007 The statnet suite of R packages contains a wide range of functionality for the statistical analysis of social networks, including the implementation of exponential-family random graph (ERG) models. In this paper we illustrate some of the functionality of
Steven M. Goodreau +4 more
doaj +1 more source
C-m-SUPERMAGIC LABELING OF FRIENDSHIP GRAPHS [PDF]
, 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
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
The total irregularity strength of m copies of the friendship graph [PDF]
, 2022 This paper deals with the totally irregular total labeling of the disjoin union of friendship graphs. The results shows that the disjoin union of copies of the friendship graph is a totally irregular total graph with the exact values of the total ...
Harmanus Batkunde +3 more
core +2 more sources
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
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
On the local metric dimension of a lollipop graph, a web graph, and a friendship graph
Journal of Physics: Conference Series, 2017 A N Cahyabudi, T A Kusmayadi
exaly +2 more sources
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 +2 more sources
Results on Relatively Prime Domination Number of Vertex Switching of Some Graphs
Ratio Mathematica, 2023 If a set S ⊆ V has at least two members and every pair of vertices u and v is such that (d(u), d(v)) = 1, then it is said to be a relatively prime dominating set.
A Jancy Vini, C Jayasekaran
doaj +1 more source