Results 21 to 30 of about 3,087,593 (348)
Total mixed domination in graphs
For a graph [Formula: see text] we call a subset [Formula: see text] a total mixed dominating set of G if each element of [Formula: see text] is either adjacent or incident to an element of S, and the total mixed domination number of G is the minimum ...
Adel P. Kazemi +2 more
doaj +1 more source
Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem
This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness Lmax for integer due dates to the scheduling problem, where along with precedence constraints given on the set V={v1,v2, …,vn} of the ...
Y. Sotskov, Evangelina I. Mihova
semanticscholar +1 more source
LGESQL: Line Graph Enhanced Text-to-SQL Model with Mixed Local and Non-Local Relations [PDF]
This work aims to tackle the challenging heterogeneous graph encoding problem in the text-to-SQL task. Previous methods are typically node-centric and merely utilize different weight matrices to parameterize edge types, which 1) ignore the rich semantics
Ruisheng Cao +5 more
semanticscholar +1 more source
Graphs with mixed metric dimension three and related algorithms
Let $ G = (V, E) $ be a simple connected graph. A vertex $ x\in V(G) $ resolves the elements $ u, v\in E(G)\cup V(G) $ if $ d_G(x, u)\neq d_G(x, v) $.
Dalal Awadh Alrowaili +3 more
doaj +1 more source
Stochastic and mixed flower graphs [PDF]
11 pages, 6 ...
C. Tyler Diggans +2 more
openaire +3 more sources
HS-integral and Eisenstein integral mixed circulant graphs
A mixed graph is called \emph{second kind hermitian integral} (\emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of the second kind are integers.
Monu Kadyan, Bikash Bhattacharjya
doaj +1 more source
Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper mixed cages are studied. Upper bounds are obtained by general construction methods and computer searches.
Geoffrey Exoo
doaj +1 more source
Moore mixed graphs from Cayley graphs
This research has been partially supported by AGAUR from the Catalan Government under project 2021SGR00434 and MICINN from the Spanish Government under project PID2020-115442RBI00.
Dalfó Simó, Cristina +1 more
openaire +2 more sources
A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures are proven to be useful in the problem of constructing dense graphs or digraphs, and this is related to the ...
Dalfó Simó, Cristina +2 more
openaire +5 more sources
Curve Your Attention: Mixed-Curvature Transformers for Graph Representation Learning [PDF]
Real-world graphs naturally exhibit hierarchical or cyclical structures that are unfit for the typical Euclidean space. While there exist graph neural networks that leverage hyperbolic or spherical spaces to learn representations that embed such ...
Sungjun Cho +5 more
semanticscholar +1 more source

