arxiv.org/abs/2308.15406v3
A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this work, we prove several results on the existence of small strictly Neumaier graphs. In particular, we present a theoretical proof of the uniqueness of the small...
arxiv.org/abs/2408.13722v2
A graph $Γ$ is called edge-regular whenever it is regular and for any two adjacent vertices, the number of their common neighbors is independent of the choice of vertices. A clique $C$ in $Γ$ is called regular whenever for any vertex out of $C$, th...
arxiv.org/abs/2308.11572v1
A Neumaier graph is a non-complete edge-regular graph with the property that it has a regular clique. In this paper, we study Neumaier Cayley graphs. We give a necessary and sufficient condition under which a Neumaier Cayley graph is a strongly regul...
arxiv.org/abs/2507.13026v2
We study a variant of the Traveling Salesman Problem, where instead of finding a single tour, we want to find a pair of two edge-disjoint tours whose longer tour is as short as possible. We investigate the Price of Diversity (PoD) for this problem, w...
arxiv.org/abs/2006.04311v2
Sampling graphs is an important task in data mining. In this paper, we describe Little Ball of Fur a Python library that includes more than twenty graph sampling algorithms. Our goal is to make node, edge, and exploration-based network sampling techn...
arxiv.org/abs/1103.6112v1
We address the problem of estimating the edge of a bounded set in R^d given a random set of points drawn from the interior. Our method is based on a transformation of estimators dedicated to uniform point processes and obtained by smoothing some of i...
www.bing.com/ck/a?!&&p=684bc3605aac4a03fd13dc3355c07e65ef69469d6cb722db0aaa615454c57a3aJmltdHM9MTc3MjQ5NjAwMA&ptn=3&ver=2&hsh=4&fclid=2052e327-77e9-6224-1e31-f43676b763af&u=a1aHR0cHM6Ly93d3cucHJpdmEuY29tL2Fib3V0LXByaXZh&ntb=1
Priva helps cities transform into Sustainable Urban Deltas by developing leading-edge technologies, services and knowledge for climate control and process automation in buildings, horticulture, and …
arxiv.org/abs/1805.03729v1
Every properly colored graph with $χ(G)=k$ colors has edge-disjoint Kempe "backbones", Kempe chains anchored by color-critical vertices for each pair of colors. Certain color permutations arrange these backbones into a clique-like structure, a stren...
arxiv.org/abs/2006.16483v1
The unique surface edge states make topological insulators a primary focus among different applications. In this article, we synthesized a large single crystal of Niobium(Nb)-doped Bi2Se3 topological insulator (TI) with a formula Nb0.25Bi2Se3. The si...
www.bing.com/ck/a?!&&p=700c7b91aaca6bf50d1f15004bf7d13e2e432a322a8133046a228995c7fc8b5cJmltdHM9MTc3MjQ5NjAwMA&ptn=3&ver=2&hsh=4&fclid=02b3e7da-42fd-6538-2a19-f0cb437864eb&u=a1aHR0cHM6Ly93d3cudGhlZnJlZWRpY3Rpb25hcnkuY29tL2V4dHJlbWU&ntb=1
Define extreme. extreme synonyms, extreme pronunciation, extreme translation, English dictionary definition of extreme. adj. 1. Most remote in any direction; outermost or farthest: the extreme edge of …
www.reddit.com/r/indianmedschool/comments/1qz2edg/everybody_talking_about_radiologywhat_about/
Everybody seems to be too much engaged in Radio vs AI debate while I was pondering upon the fact that if pattern recognition is really what's the edge for AI,then what about the field which utilizes ...
arxiv.org/abs/astro-ph/0607090v1
Insight into the origin of unusual events like the eruption of V838 Mon can be obtained from studies of the stellar populations from which they arise. V838 Mon lies in an intriguing region of the Galaxy, toward the warped outer edge of the disk, wi...
en.wikipedia.org/wiki/Pavonis_Mons
a Sky Ramp. Pavonis Mons stands at the southern edge of the Tharsis quadrangle - approximately 400 km southwest of Ascraeus Mons (the northernmost of
www.blog.google/topics/google-cloud/making-google-cloud-faster-more-available-and-cost-effective-extending-sdn-public-internet-espresso/
Points: 327 | Comments: 94 | Author: vgt
arxiv.org/abs/2102.02000v1
This papers presents a novel quantised transform (the Sinclair-Town or ST transform for short) that subsumes the rolls of both edge-detector, MSER style region detector and corner detector. The transform is similar to the $unsharp$ transform but the...
arxiv.org/abs/1602.00877v2
In this paper, we study the information-theoretic limits of community detection in the symmetric two-community stochastic block model, with intra-community and inter-community edge probabilities $\frac{a}{n}$ and $\frac{b}{n}$ respectively. We consid...
arxiv.org/abs/2511.17240v2
We study the problem of learning an unknown graph via group queries on node subsets, where each query reports whether at least one edge is present among the queried nodes. In general, learning arbitrary graphs with $n$ nodes and $k$ edges is hard in...
arxiv.org/abs/2511.00888v1
We propose a structure to represent the social fabric of a group. We call it the `cohesion network' of the group. It can be seen as a graph whose vertices are strict subgroups and whose edges indicate a prescribed `pro-social behaviour' from one subg...
arxiv.org/abs/2104.10988v2
Boij-Söderberg Theory views the Betti diagrams of graded modules over polynomial rings as vectors in a rational vector space, and studies the cone that these vectors generate (called a 'Betti Cone'). The objects of study in this paper are the Betti...
arxiv.org/abs/2211.00468v1
Ever science the invention of solar cells, thermodynamics has been used to assess their performance limits, guiding advances in materials science and photovoltaic technology to reduce the gap between the practical efficiencies and the thermodynamic l...