Results 51 to 60 of about 4,787 (279)
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
Friendship decompositions of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On social networks and collaborative recommendation [PDF]
Social network systems, like last.fm, play a significant role in Web 2.0, containing large amounts of multimedia-enriched data that are enhanced both by explicit user-provided annotations and implicit aggregated feedback describing the personal ...
Stathopoulos, Vassilios +8 more
core +1 more source
Quadratic Embedding Constants of Graph Joins [PDF]
The quadratic embedding constant (QE constant) of a graph is a new characteristic value of a graph defined through the distance matrix. We derive formulae for the QE constants of the join of two regular graphs, double graphs and certain lexicographic ...
Lou, Zhenzhen +2 more
core +2 more sources
In graph theory, the Friendship Theorem states that any finite graph in which every two vertices share exactly one common neighbor has a vertex adjacent to all other vertices.
Zimmermann, David Sawyer
core +1 more source
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
A line graph which is produced by the exact version of the LPAM method with amplified commute distance for the School Friendship network (θ = 0.5, k = 7). [PDF]
A line graph which is produced by the exact version of the LPAM method with amplified commute distance for the School Friendship network (θ = 0.5, k = 7).
Leonidas Pitsoulis (11331297) +2 more
core +1 more source
Temporal Exponential Random Graph Models with btergm: Estimation and Bootstrap Confidence Intervals
The xergm package is an implementation of extensions to the exponential random graph model (ERGM). It acts as a meta-package for multiple constituent packages.
Philip Leifeld +2 more
doaj +1 more source
MagmaFlow: A desktop platform for artificial intelligence‐driven expression analysis
MagmaFlow is a free, no‐code platform for gene expression analysis. It generates interactive volcano plots, links genes to literature, pathways, and diseases, prioritizes candidates using millions of publications, identifies affected biological processes, builds network diagrams, and exports publication‐ready figures and reports for macOS and Windows ...
Carlos E. Buss +7 more
wiley +1 more source
On irregularity strength of disjoint union of friendship graphs
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 friendship graphs.
Ali Ahmad 0003 +2 more
openaire +3 more sources

