Results 1 to 10 of about 4,129,862 (348)
The role of the anti-regular graph in the spectral analysis of threshold graphs [PDF]
The purpose of this paper is to highlight the role played by the anti-regular graph within the class of threshold graphs. Using the fact that every threshold graph contains a maximal anti-regular graph, we show that some known results, and new ones, on ...
Cesar O. Aguilar +3 more
semanticscholar +1 more source
G-Mixup: Graph Data Augmentation for Graph Classification [PDF]
This work develops \emph{mixup for graph data}. Mixup has shown superiority in improving the generalization and robustness of neural networks by interpolating features and labels between two random samples.
Xiaotian Han +3 more
semanticscholar +1 more source
GemNet: Universal Directional Graph Neural Networks for Molecules [PDF]
Effectively predicting molecular interactions has the potential to accelerate molecular dynamics by multiple orders of magnitude and thus revolutionize chemical simulations.
Johannes Gasteiger +2 more
semanticscholar +1 more source
Laplacian spectra of regular graph transformations [PDF]
Given a graph G with vertex set V(G)=V and edge set E(G)=E, let G^l be the line graph and G^c the complement of G. Let G^0 be the graph with V(G^0)=V and with no edges, G^1 the complete graph with the vertex set V, G^+=G and G^-=G^c. Let B(G) (B^c(G)) be
Ai-Ping Deng, A. Kelmans, J. Meng
semanticscholar +1 more source
Classifying cubic symmetric graphs of order 52p2; pp. 55–60 [PDF]
An automorphism group of a graph is said to be s-regular if it acts regularly on the set of s-arcs in the graph. A graph is s-regular if its full automorphism group is s-regular.
Shangjing Hao, Shixun Lin
doaj +1 more source
Non-ergodic delocalized phase in Anderson model on Bethe lattice and regular graph [PDF]
We develop a novel analytical approach to the problem of single particle localization in infinite dimensional spaces such as Bethe lattice and random regular graph models.
V. E. Kravtsov, B. Altshuler, L. Ioffe
semanticscholar +1 more source
DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST
In the class of distance-regular graphs of diameter 3 there are 5 intersection arrays of graphs with at most 28 vertices and noninteger eigenvalue. These arrays are \(\{18,14,5;1,2,14\}\), \(\{18,15,9;1,1,10\}\), \(\{21,16,10;1,2,12\}\), \(\{24,21,3;1,3 ...
Konstantin S. Efimov +1 more
doaj +1 more source
There is no (75,32,10,16) strongly regular graph [PDF]
We show that there is no (75,32,10,16) strongly regular graph. The result is obtained by a mix of algebraic and computational approaches. The main idea is to build large enough induced structure and apply the star complement technique. Our result implies
Jernej Azarija, Tilen Marc
semanticscholar +1 more source
A new strongly regular graph with parameters (81,30,9,12) is found as a graph invariant under certain subgroup of the full automorphism group of the previously known strongly regular graph discovered in 1981 by J. H. van Lint and A. Schrijver.
Dean Crnković, Andrea Švob
doaj +1 more source
Bondage and non-bondage sets in regular intuitionistic fuzzy graphs [PDF]
The concept of strong edges in domination set and its properties are discussed. The increasing or reducing domination numbers using cardinality are also studied.
R. Buvaneswari, K. Umamaheswari
doaj +1 more source

