The vertex-edge marking game is played between two players on a graph, $G=(V,E)$, with one player marking vertices and the other marking edges. The players want to minimize/maximize, respectively, the number of marked edges incident to an unmarked ve...
A corner in a map is an edge-vertex-edge triple consisting of two distinct edges incident to the same vertex. A corneration is a set of corners that covers every arc of the map exactly once. Cornerations in a dart-transitive map generalize the notion...
Let $P_n$ and $K_n$ denote the induced path and complete graph on $n$ vertices, respectively. The {\em kite} is the graph obtained from a $P_4$ by adding a vertex and making it adjacent to all vertices in the $P_4$ except one vertex with degree 1. A...
We present an evaluation of the two master integrals for the crossed vertex diagram with a closed loop of top quarks that allows for an easy numerical implementation. The differential equations obeyed by the master integrals are used to generate powe...
Given an undirected graph $G = (V, E)$, and a vertex $r\in V$, an $r$-acyclic orientation of $G$ is an orientation $OE$ of the edges of $G$ such that the digraph $OG = (V, OE)$ is acyclic and $r$ is the unique vertex with indegree equal to 0. For $w\...
We present an algorithm for distributed networks to efficiently find a small vertex cut in the CONGEST model. Given a positive integer $κ$, our algorithm can, with high probability, either find $κ$ vertices whose removal disconnects the network or...
A set of vertices in a graph is called independent if no two vertices of the set are connected by an edge. In this paper we use the state matrix recursion algorithm, developed by Oh, to enumerate independent vertex sets in a grid graph and even furth...
Tags: java, jdbc, tigergraph | Score: 0
A vertex coloring of a graph is called "perfect" if for any two colors $a$ and $b$, the number of the color-$b$ neighbors of a color-$a$ vertex $x$ does not depend on the choice of $x$, that is, depends only on $a$ and $b$ (the corresponding partitio...
Consider a finite simple digraph $D$ with vertex set $V(D)$. An Italian dominating function (IDF) on $D$ is a function $f:V(D)\rightarrow\{0,1,2\}$ satisfying every vertex $u$ with $f(u)=0$ has an in-neighbor $v$ with $f(v)=2$ or two in-neighbors $w$...
The first Zagreb index $M_{1}$ of a graph is defined as the sum of the square of every vertex degree, and the second Zagreb index $M_{2}$ of a graph is defined as the sum of the product of vertex degrees of each pair of adjacent vertices. In this pap...
We will partially classify spaces of characters of vertex operator algebras $V$ with central charges 8 and 16, such that the spaces of characters is 3-dimensional and the characters forms a basis of the solution space of a third order monic modular l...
Vertex AI is a managed machine learning (ML) and artificial intelligence (AI) platform developed by Google Cloud. It provides a unified environment for
This paper surveys results about token addition and removal (TAR) reconfiguration for several well-known vertex set parameters including domination, power domination, standard zero forcing, and PSD zero forcing. We also expand the range of parameters...
Given a c-colored graph G, a vertex of G is happy if it has the same color as all its neighbors. The notion of happy vertices was introduced by Zhang and Li to compute the homophily of a graph. Eto, et al. introduced the Maker-Maker version of the Ha...
We define non-commutative versions of the vertex packing polytope, the theta convex body and the fractional vertex packing polytope of a graph, and establish a quantum version of the Sandwich Theorem of Grötschel, Lovász and Schrijver. We define ne...
Vertex AI Agent Builder helps you build and orchestrate multi-agent experiences.
Create Google quality search experiences across your websites and intranet. Vertex AI Search also offers a comprehensive RAG system for your generative AI applications including OOTB RAG, vector search and DIY RAG components.
Boost e-commerce conversions and revenue with Vertex AI Search for commerce. Delivers personalized and intuitive shopping experiences.