Results 151 to 160 of about 420,658 (213)

Optimal Designs for Discrete Choice Models Via Graph Laplacians. [PDF]

open access: yesJ Stat Theory Pract
Röttger F, Kahle T, Schwabe R.
europepmc   +1 more source

A Max-Flow Approach to Random Tensor Networks. [PDF]

open access: yesEntropy (Basel)
Fitter K, Loulidi F, Nechita I.
europepmc   +1 more source

Digital simulation of zero-temperature spontaneous symmetry breaking in a superconducting lattice processor. [PDF]

open access: yesNat Commun
Hu CK   +13 more
europepmc   +1 more source

Connectivity Labeling in Faulty Colored Graphs. [PDF]

open access: yesDistrib Comput
Petruschka A, Sapir S, Tzalik E.
europepmc   +1 more source

Metric dimension of star fan graph. [PDF]

open access: yesSci Rep
Prabhu S, Jeba DSR, Stephen S.
europepmc   +1 more source

On $2$-integral Cayley graphs

open access: yes
In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to $k$.
Arezoomand, Majid   +3 more
core  

Home - About - Disclaimer - Privacy