Vertex normal - Wikipedia
Vertex normals can also be computed for polygonal approximations to surfaces such as NURBS, or specified explicitly for artistic purposes. Vertex normals are
Bounding the Porous Exponential Domination Number of Apollonian Networks
Given a graph G with vertex set V, a subset S of V is a dominating set if every vertex in V is either in S or adjacent to some vertex in S. The size of a smallest dominating set is called the domination number of G. We study a variant of domination c...
Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
For a digraph $G$, a set $F\subseteq V(G)$ is said to be a feedback vertex set (FVS) if $G-F$ is acyclic. The problem of finding a smallest FVS is NP-hard. We present a matrix scaling technique for finding feedback vertex sets in un-weighted directed...
Classification of screening systems for lattice vertex operator algebras
We study and classify systems of certain screening operators arising in a generalized vertex operator algebra, or more generally an abelian intertwining algebra with an associated vertex operator (super)algebra. Screening pairs arising from weight on...
Order Independence in Asynchronous Cellular Automata
A sequential dynamical system, or SDS, consists of an undirected graph Y, a vertex-indexed list of local functions F_Y, and a permutation pi of the vertex set (or more generally, a word w over the vertex set) that describes the order in which these l...
On the Computational Complexities of Various Geography Variants
Generalized Geography is a combinatorial game played on a directed graph. Players take turns moving a token from vertex to vertex, deleting a vertex after moving the token away from it. A player unable to move loses. It is well known that the computa...
Every connected graph admits a local antimagic orientation and almost every graph admits a…
An undirected graph $G$ is said to admit an antimagic orientation if there exist an orientation $D$ and a bijection between $E(G)$ and $\{1,2,\ldots,|E(G)|\}$ such that any two vertices have distinct vertex sums, where the vertex sum of a vertex is t...
Vertex-minors and the Erdős-Hajnal conjecture
We prove that for every graph $H$, there exists $\varepsilon>0$ such that every $n$-vertex graph with no vertex-minors isomorphic to $H$ has a pair of disjoint sets $A$, $B$ of vertices such that $|A|, |B|\ge \varepsilon n$ and $A$ is complete or ant...
GoogleCloudPlatform/mlops-with-vertex-ai
An end-to-end example of MLOps on Google Cloud using TensorFlow, TFX, and Vertex AI (⭐ 417)
RayTale/Vertex
Vertex is a distributed, ultimately consistent, event traceable cross platform framework based on Orleans, which is used to build high-performance, high throughput, low latency, scalable distributed applications (⭐ 296)
Quantum vertex $C((t))$-algebras and quantum affine algebras
We give a summary of the theory of (weak) quantum vertex $\C((t))$-algebras and the association of quantum affine algebras with (weak) quantum vertex $\C((t))$-algebras....
GoogleCloudPlatform/vertex-ai-samples
Notebooks, code samples, sample apps, and other resources that demonstrate how to use, develop and manage machine learning and generative AI workflows using Google Cloud Vertex AI. (⭐ 657)
Vertex connectivity - Wikipedia
be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever fewer than k vertices are removed. The vertex-connectivity
GoogleCloudPlatform/vertex-ai-creative-studio
GenMedia Creative Studio is a Vertex AI generative media user experience highlighting the use of Imagen, Veo, Gemini ?, Gemini TTS, Chirp 3, Lyria and other generative media APIs on Google Cloud. (⭐ 969)
statmike/vertex-ai-mlops
Google Cloud Platform Vertex AI end-to-end workflows for machine learning operations (⭐ 682)
Vertex algebras and Teichmüller modular forms
We associate to any holomorphic vertex algebra a collection of Teichmüller modular forms, one in each genus. In genus one we obtain the character of the vertex algebra, and we thus reprove Zhu's modularity result. In higher genus, we prove that thes...
On the k-edge magic graphs
Let $G$ be a graph with vertex set V and edge set E such that |V| = p and |E| = q. For integers k\geq 0, define an edge labeling f : E \rightarrow \{k,k+1,....,k+q-1\} and define the vertex sum for a vertex $v$ as the sum of the labels of the edges i...
Kings and Kernels in Semicomplete Compositions
Let $k$ be an integer with $k\geq 2$. A $k$-king in a digraph $D$ is a vertex which can reach every other vertex by a directed path of length at most $k$ and a non-king is a vertex which is not a 3-king. A subset $K$ is $k$-independent if for every p...
Efficient Vertex-Label Distance Oracles for Planar Graphs
We consider distance queries in vertex-labeled planar graphs. For any fixed $0 < ε\leq 1/2$ we show how to preprocess a directed planar graph with vertex labels and arc lengths into a data structure that answers queries of the following form. Given...
alihashmiii/2D-vertex-model
vertex model for simulating two-dimensional epithelial tissues (⭐ 8)