Results 41 to 50 of about 969,174 (273)
Mixed metric dimension of hollow coronoid structure
Coronoid systems actually arrangements of hexagons into six sides of benzenoids. By nature, it is an organic chemical structure. Hollow coronoids are primitive and catacondensed coronoids. It is also known as polycyclic conjugated hydrocarbons.
Ali N.A. Koam +3 more
doaj +1 more source
Decompositions of the λ-Fold Complete Mixed Graph into Mixed 6-Stars
Graph and digraph decompositions are a fundamental part of design theory. Probably the best known decompositions are related to decomposing the complete graph into 3-cycles (which correspond to Steiner triple systems), and decomposing the complete ...
Robert Gardner, Kazeem Kosebinu
doaj +1 more source
Coloring Mixed and Directional Interval Graphs
A mixed graph has a set of vertices, a set of undirected egdes, and a set of directed arcs. A proper coloring of a mixed graph $G$ is a function $c$ that assigns to each vertex in $G$ a positive integer such that, for each edge $uv$ in $G$, $c(u) \ne c(v)$ and, for each arc $uv$ in $G$, $c(u) < c(v)$. For a mixed graph $G$, the chromatic number $χ(G)
Grzegorz Gutowski +5 more
openaire +5 more sources
Some Covering and Packing Problems for Mixed Triples
A mixed graph has both edges and directed edges (or “arcs”). A complete mixed graph on v vertices, denoted Mv, has, for every pair of vertices u and v, an edge {u,v}, an arc (u,v), and an arc (v,u).
Benkam Bobga, Robert Gardner
doaj +1 more source
Mixed Linear Layouts of Planar Graphs
A $k$-stack (respectively, $k$-queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing (non-nested) edges with respect to the vertex ordering. In 1992, Heath and Rosenberg conjectured
C Bachmaier +12 more
core +1 more source
Multi-Scale Mixed Dense Graph Convolution Network for Skeleton-Based Action Recognition
In skeleton-based action recognition, the approaches based on graph convolutional networks(GCN) have achieved remarkable performance by modeling spatial-temporal graphs to explore the physical dependencies between body joints.
Hailun Xia, Xinkai Gao
doaj +1 more source
Integral Mixed Unit Interval Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Le, Van Bang, Rautenbach, Dieter
openaire +2 more sources
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
Colourings of $(m, n)$-coloured mixed graphs [PDF]
A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \geq 0$ colours, and each arc is assigned one of ...
Gary MacGillivray +2 more
doaj +1 more source
The Vertex-Edge Resolvability of Some Wheel-Related Graphs
A vertex w∈VH distinguishes (or resolves) two elements (edges or vertices) a,z∈VH∪EH if dw,a≠dw,z. A set Wm of vertices in a nontrivial connected graph H is said to be a mixed resolving set for H if every two different elements (edges and vertices) of H ...
Bao-Hua Xing +4 more
doaj +1 more source

