Results 101 to 110 of about 6,572,416 (223)

Centralizers in graph products of groups

Journal of Algebra, 2007
Graph products of groups generalize both free and direct products of groups just as graph groups generalize both free and free Abelian groups. For graph groups the centralizer is known to be itself a graph group [see \textit{H. Servatius}, J. Algebra 126, No. 1, 34-60 (1989; Zbl 0682.20022)].
openaire   +2 more sources

Graph Adaptive Attention Network with Cross-Entropy

Entropy
Non-Euclidean data, such as social networks and citation relationships between documents, have node and structural information. The Graph Convolutional Network (GCN) can automatically learn node features and association information between nodes.
Zhao Chen
doaj   +1 more source

A set oriented approach to global optimal control [PDF]

, 2002
We describe an algorithm for computing the value function for 'all source, single destination' discrete-time nonlinear optimal control problems together with approximations of associated globally optimal control strategies.
Junge, O, Osinga, Hinke M
core  

Scientific Knowledge Graph and Trend Analysis of Central Sensitization: A Bibliometric Analysis

Journal of Pain Research, 2022
Zhuo Li,1,2,* Chi Xu,2,* Jun Fu,2 Maimaiti Zulipikaer,2 Tao Deng,2 Jiying Chen2 1School of Medicine, Nankai University, Tianjin, People’s Republic of China; 2Department of Orthopedic Surgery, Chinese PLA General Hospital, Beijing, People’s ...
Li Z, Xu C, Fu J, Zulipikaer M, Deng T, Chen J   +5 more
doaj  

Central partition for a partition-distance and strong pattern graph

Revstat Statistical Journal, 2004
When several clustering algorithms are applied to a dataset E or the same algorithm with different parameters, we get several different partitions of the dataset.
Joaquim F. Pinto da Costa , P.R. Rao
doaj   +1 more source

Limit theorems for a random directed slab graph [PDF]

, 2010
We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers.
Denisov, Denis, Foss, Sergey, Konstantopoulos, Takis   +2 more
core   +3 more sources

Spectra of new graph operations based on central graph

, 2021
In this paper, we introduce central vertex corona, central edge corona, and central edge neighborhood corona of graphs using central graph. Also, we determine their adjacency spectrum, Laplacian spectrum and signless Laplacian spectrum. From our results, it is possible to obtain infinitely many pairs of adjacency (respectively, Laplacian and signless ...
Jahfar, T K, Chithra, A V
openaire   +2 more sources

Tripotent Divisor Graph of a Commutative Ring

International Journal of Mathematics and Mathematical Sciences
In this work, we introduce a new concept called the tripotent divisor graph of a commutative ring. It is defined with vertices set in a ring R, where distinct vertices r1 and r2 are connected by an edge if their product belongs to the set of all nonunite
Luma A. Khaleel, Husam Q. Mohammad, Nazar H. Shuker   +2 more
doaj   +1 more source

Computing Some Topological Indices of Two Kinds of Dendrimer Graphs Gn and Hn

Journal of Mathematics
Dendrimer molecules are macromolecules which have many applications in nanosciences, drug delivery, biology, and different areas of sciences. Topological indices of chemical graph theory are numerical descriptor of a molecular structure.
Hojat Kaviani, Lotfallah Pourfaraj
doaj   +1 more source

PRIME LABELING OF AMALGAMATION OF FLOWER GRAPHS

Barekeng
Graph labeling is the assigning of labels represented by integers or symbols to graph elements, edges and/or vertices (or both) of a graph. Consider a simple graph  with a vertex-set  and an edge-set .
Desi Rahmadani, Ardi Aldiansyah, Dina Pratiwi, Mahmuddin Yunus, Vita Kusumasari   +4 more
doaj   +1 more source