Results 41 to 50 of about 140,780 (247)
Annihilating Graph of Abelian Groups
پژوهشهای ریاضی, 2021 In [18], the author associated a graph to an R -module M which is precisely a generalization of annihilating ideal graph of a commutative ring, see [15] and [16]. Inasmuch as Abelian groups are precisely Z-modules, in this paper we relate an annihilating
saeed safaeeyan, Soraya Barzegar
doaj
Multi-view Clustering Based on Bipartite Graph Cross-view Graph Diffusion [PDF]
Jisuanji kexueMulti-view clustering is an research hotspots in the field of unsupervised learning.Recently,the method based on cross-view graph diffusion uses the complementary information between multiple views to obtain a unified graph for clustering on the basis of
WANG Jinfu, WANG Siwei, LIANG Weixuan, YU Shengju, ZHU En
doaj +1 more source
ABC energies and spectral radii of some graph operations
Frontiers in Physics, 2022 The present article presents some new results relating to Atomic Bond Connectivity energies and Spectral radii of generalized splitting and generalized shadow graphs constructed on the basis of some fundamental families of cycle graph Cn, complete graph ...
Ahmad Bilal, Muhammad Mobeen Munir
doaj +1 more source
A note on star coloring of central graph of bipartite graph and corona graph of complete graph with path and cycle [PDF]
Transactions on Combinatorics, 2012 In this paper, we find the star chromatic number of central graph of complete bipartite graph and corona graph of complete graph with path and cycle.
V. J. Vernold, M. Venkatachalam
doaj
Opuscula Mathematica, 2011 It has been shown in [S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Preprint MD 022, (2006)] that any bipartite graph \(K_{a,b}\), is decomposable into open trails of prescribed even lengths.
Sylwia Cichacz, Agnieszka Görlich
doaj +1 more source
Local colourings and monochromatic partitions in complete bipartite graphs
, 2016 We show that for any $2$-local colouring of the edges of the balanced complete bipartite graph $K_{n,n}$, its vertices can be covered with at most~$3$ disjoint monochromatic paths.
Lang, Richard, Stein, Maya
core +1 more source
On dynamic colouring of cartesian product of complete graph with some graphs
Journal of Taibah University for Science, 2020 A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj +2 more
doaj +1 more source
Advanced Science, EarlyView.A deep learning framework called MolVisGNN is proposed to fuse 3D molecular visual information of drugs with multi‐source features, which proves the importance of 3D molecular visual information of drugs and the advancedness of this model in the field of drug discovery, and provides a reference for how to more comprehensively express small molecule ...
Zimai Zhang +9 more
wiley +1 more source
On the critical group of matrices [PDF]
, 2010 Given a graph G with a distinguished vertex s, the critical group of (G,s) is the cokernel of their reduced Laplacian matrix L(G,s). In this article we generalize the concept of the critical group to the cokernel of any matrix with entries in a ...
Carlos, E. Valencia, Hugo Corrales
core
Annals of Neurology, EarlyView.Objective Mutations in TARDBP (encoding TDP‐43) are associated with the neurodegenerative disease amyotrophic lateral sclerosis (ALS) and include familial missense mutations where there are a lack of models and mechanisms examining how they are pathogenic.
Ziyaan A. Harji +10 more
wiley +1 more source