Results 11 to 20 of about 115,711 (260)
Probabilistic regular graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 In Proceedings INFINITY 2010, arXiv:1010 ...
Bertrand, Nathalie, Morvan, Christophe
openaire +4 more sources
Formalized Mathematics, 2023 Abstract In this article regular graphs, both directed and undirected, are formalized in the Mizar system [7], [2], based on the formalization of graphs as described in [10]. The handshaking lemma is also proven.
openaire +2 more sources
Regular colorings in regular graphs
Discussiones Mathematicae Graph Theory, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernshteyn, Anton +6 more
openaire +3 more sources
IEEE Access, 2014 A new regularization technique for graph Laplacians arising from triangular meshes of closed and open structures is presented. The new technique is based on the analysis of graph Laplacian spectrally equivalent operators in terms of Sobolev norms and on ...
Rajendra Mitharwal +1 more
doaj +1 more source
Artist Similarity for Everyone: A Graph Neural Network Approach
Transactions of the International Society for Music Information Retrieval, 2022 Artist similarity plays an important role in organizing, understanding, and subsequently, facilitating discovery in large collections of music. In this paper, we present a hybrid approach to computing similarity between artists using graph neural ...
Filip Korzeniowski +2 more
doaj +1 more source
Abnormal Electricity Behavior Recognition of Graph Regularization Nonlinear Ridge Regression Model [PDF]
Jisuanji gongcheng, 2018 For the detection of abnormal electricity behavior by users,power companies usually adopt manual inspection methods,however,this method requires a lot of manpower and material resources,and is influened by subjective factors.Therefore,an abnormal ...
ZHANG Xiaofei,GENG Juncheng,SUN Yubao
doaj +1 more source
INDUCED REGULAR PERFECT GRAPHS
South East Asian J. of Mathematics and Mathematical Sciences, 2023 A graph G is said to be R-perfect if, for all induced subgraphs H of G, the induced regular independence number of each induced subgraph H is equal to its corresponding induced regular cover. Here, the induced regular independence number is the maximum number of vertices in H such that no two belong to the same induced regular subgraph in H, and the ...
Jayakumar, Gokul S., V., Sangeetha
openaire +2 more sources
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\).
Kratochvı́l, Jan +2 more
openaire +1 more source
Graph Regularization Methods in Soft Detector Fusion
IEEE Access, 2023 This paper presents a theoretical derivation of two new graph-based regularization methods for fusing the individual results of multiple detectors (two-class classifiers).
Addisson Salazar +3 more
doaj +1 more source
Ars Mathematica Contemporanea, 2019 20 pages, 6 ...
Potočnik, Primož, Vidali, Janoš
openaire +5 more sources