Results 31 to 40 of about 24,126 (306)

Covering Regular Graphs

Journal of Combinatorial Theory, Series B, 1997
A covering projection from a graph \(G\) onto a graph \(H\) is a ``local isomorphism'': a mapping from the vertex set of \(G\) onto the vertex set of \(H\) such that, for every \(v\in V(G)\), the neighborhood of \(v\) is mapped bijectively onto the neighborhood (in \(H\)) of the image of \(v\).
Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle   +2 more
openaire   +1 more source

JONNEE: Joint Network Nodes and Edges Embedding

IEEE Access, 2021
Recently, graph embedding models significantly improved the quality of graph machine learning tasks, such as node classification and link prediction. In this work, we propose a model called JONNEE (JOint Network Nodes and Edges Embedding), which learns ...
Ilya Makarov, Ksenia Korovina, Dmitrii Kiselev   +2 more
doaj   +1 more source

Graph-based regularization for spherical signal interpolation [PDF]

, 2010
This paper addresses the problem of the interpolation of 2-d spherical signals from non-uniformly sampled and noisy data. We propose a graph-based regularization algorithm to improve the signal reconstructed by local interpolation methods such as nearest
Pascal Frossard, Tamara Tosic, Tosic, Tamara, Frossard, Pascal   +3 more
core   +1 more source

Feature representation ‎via‎ graph-regularized ‎entropy-‎weighted nonnegative matrix factorization [PDF]

AUT Journal of Mathematics and Computing
Feature extraction plays a crucial role in dimensionality reduction in machine learning applications. Nonnegative Matrix Factorization (NMF) has emerged as a powerful technique for dimensionality reduction; however, its equal treatment of all features ...
Hazhir Sohrabi, Shahrokh Esmaeili, Parham Moradi   +2 more
doaj   +1 more source

On regular graphs. II

Journal of Combinatorial Theory, Series B, 1971
AbstractThis paper is a continuation of [1] and we shall use the same terminology. The main result of this part is the following: Suppose that the automorphism group of a connected graph of valency p + 1, p a prime, has a subgroup which acts as a regular permutation group on the set of s-arcs of the graph. Then s ≤ 7 and s ≠ 6.
openaire   +3 more sources

On orbital regular graphs and frobenius graphs

Discrete Mathematics, 1998
A group is a Frobenius group if it acts transitively but not freely on a set such that no two elements are fixed by a non-trivial element of the group. An orbital-regular graph is a finite graph whose automorphism group has a subgroup which is transitive on the edges and contains no element which fixes two vertices.
Xin Gui Fang, Cai Heng Li, Cheryl E. Praeger   +2 more
openaire   +2 more sources

A simplifying feature of the heterotic one loop four graviton amplitude

Physics Letters B, 2018
We show that the weight four modular graph functions that contribute to the integrand of the t8t8D4R4 term at one loop in heterotic string theory do not require regularization, and hence the integrand is simple.
Anirban Basu
doaj   +1 more source

MV-GDCMFL: A Multi-view Graph Dual Regularized Collaborative Matrix Factorization with L2,1-norm regularization terms to predict drug–target interactions

Array
Traditional wet experiments to identify drug–target interactions (DTIs) are costly and time consuming. Therefore, machine learning-based methods are commonly used to speed up the identification process.
Junjun Zhang, Tingfeng Zeng
doaj   +1 more source

On extension of regular graphs [PDF]

Journal of Discrete Mathematical Sciences and Cryptography, 2018
arXiv admin note: substantial text overlap with arXiv:1407 ...
Banerjee, Anirban, Bej, Saptarshi
openaire   +2 more sources

Global-Local Consistency Constrained Deep Embedded Clustering for Hyperspectral Band Selection

IEEE Access, 2023
Hyperspectral band selection plays a key role for overcoming the curse of dimensionality in the classification of hyperspectral remote sensing images (HSIs).
Shangfeng Ning, Wenhong Wang
doaj   +1 more source