Results 41 to 50 of about 4,787 (279)
On local antimagic vertex coloring of corona products related to friendship and fan graph [PDF]
, 2021 Let G=(V,E) be connected graph. A bijection f : E → {1,2,3,..., |E|} is a local antimagic of G if any adjacent vertices u,v ∈ V satisfies w(u)≠ w(v), where w(u)=∑e∈E(u) f(e), E(u) is the set of edges incident to u. When vertex u is assigned the color w(u)
Zein Rasyid Himami, Denny Riama Silaban
core +2 more sources
On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree [PDF]
, 2022 Given a graph G with vertex set V(G) and edge set E(G), for the bijective function f(V(G))→{1,2,⋯,|V(G)|}, the associated weight of an edge xy∈E(G) under f is w(xy)=f(x)+f(y). If all edges have pairwise distinct weights, the function f is
Dafik Dafik +3 more
core +1 more source
A method of automatically estimating user age using social connections
Труды Института системного программирования РАН, 2018 The work is devoted to methods of social network users’ age detection. Social networks allow users to fill their profiles that may contain an age. Profiles are not fully filled, so the task of unknown attributes detection arises.
A. G. Gomzin, S. D. Kuznetsov
doaj +1 more source
On the spectral determinations of the connected multicone graphs
AKCE International Journal of Graphs and Combinatorics, 2020 In this study we investigate the spectra of the family of connected multicone graphs. A multicone graph is defined to be the join of a clique and a regular graph. Let , and be natural numbers, and let denote a complete graph on vertices.
Ali Zeydi Abdian +6 more
doaj +1 more source
Edge odd graceful labeling of some path and cycle related graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Solairaju and Chithra introduced a new type of labeling of a graph with vertices and edges called an edge odd graceful labeling if there is a bijection from the edges of the graph to the set such that, when each vertex is assigned the sum of all edges ...
S.N. Daoud
doaj +1 more source
Domination number of middle graphs [PDF]
Transactions on Combinatorics, 2023 In this paper, we study the domination number of middle graphs. Indeed, we obtain tight bounds for this number in terms of the order of the graph G. We also compute the domination number of some families of graphs such as star graphs, double start graphs,
Farshad Kazemnejad +3 more
doaj +1 more source
Infinite friendship graphs with infinite parameters
Journal of Combinatorial Theory, Series B, 1991 We study infinite graphs in which every set of \(\kappa\) vertices has exactly \(\lambda\) common neighbours. We prove that there exist \(2^{\sigma}\) such graphs of each infinite order \(\sigma\) if \(\kappa\) is finite and that for \(\kappa\) infinite there are \(2^{\lambda}\) of them of order \(\lambda\) and none of cardinality greater than ...
Gena Hahn +2 more
openaire +2 more sources
The Friendship Problem on Graphs. [PDF]
J. Multiple Valued Log. Soft Comput., 2008 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. Moreover, we generalize this theorem in a natural way, assuming that every pair of nodes occupies l ≥ 2 common neighbors.
Mertzios, G.B., Unger, W.
openaire +2 more sources
Perceived friendship network of socially anxious adolescent girls [PDF]
, 2022 In this study we investigated how social anxiety and expressed friendship relate to the perceived friendship network of adolescent girls. We define an expressed friendship as a friendship choice made by an individual, and a perceived friend as one whom ...
Bastian, B +5 more
core +1 more source
The Distance Irregular Reflexive k-Labeling of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 A total k-labeling is a function fe from the edge set to the set {1, 2, . . . , ke} and a function fv from the vertex set to the set {0, 2, 4, . . . , 2kv}, where k = max{ke, 2kv}.
Ika Hesti Agustin +4 more
doaj +1 more source