Results 41 to 50 of about 728,663 (278)
A method of automatically estimating user age using social connections
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
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
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]
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
On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph
Let c be a k-coloring of a connected graph G and let pi={C1,C2,...,Ck} be the partition of V(G) induced by c. For every vertex v of G, let c_pi(v) be the coordinate of v relative to pi, that is c_pi(v)=(d(v,C1 ),d(v,C2 ),...,d(v,Ck )), where d(v,Ci )=min{d(v,x)|x in Ci }.
Salindeho, Brilly Maxel +2 more
openaire +2 more sources
The Friendship Problem on Graphs. [PDF]
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
Infinite friendship graphs with infinite parameters
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 +3 more sources
The Distance Irregular Reflexive k-Labeling of Graphs
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
Computation of general Randi\'{c} polynomial and general Randic energy of some graphs [PDF]
The general Randi\'{c} matrix of a graph $G$, denoted by $GR(G)$ is an $n \times n$ matrix whose $(i, j)$-th entry is $(d_i d_j)^\alpha$, $\alpha \in \Bbb{R}$ if the vertices $v_i$ and $v_j$ are adjacent and $0$ otherwise, where $d_i$ is the degree of a ...
Harishchandra S. Ramane +1 more
doaj
Edge δ− Graceful Labeling for Some Cyclic-Related Graphs
In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the induced mapping ...
Mohamed R. Zeen El Deen
doaj +1 more source

