Results 61 to 70 of about 937,585 (316)
Decompositions of the λ-Fold Complete Mixed Graph into Mixed 6-Stars
AppliedMathGraph 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
Mixed metric dimension of hollow coronoid structure
Ain Shams Engineering Journal, 2023 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
Some Covering and Packing Problems for Mixed Triples
AppliedMathA 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
Improved Approximation for Orienting Mixed Graphs
, 2012 An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that admit a directed ...
Gamzu, Iftah, Medina, Moti
core +1 more source
Mixing 3-Colourings in Bipartite Graphs [PDF]
European Journal of Combinatorics, 2007 AbstractFor a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the corresponding colourings differ on precisely one vertex of G. We consider the following question: given G, how easily can one decide whether or not C3(G) is connected?
Cereceda, Luis +2 more
openaire +5 more sources
Mixed Linear Layouts of Planar Graphs
, 2017 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
Extremal graphs with maximum complementary second Zagreb index
AIMS MathematicsThe complementary second Zagreb index of a graph $ G $ is defined as $ cM_{2}(G) = \sum_{uv \in E(G)} |d_{G}(u)^{2}-d_{G}(v)^{2}| $. In this paper, we prove that a graph having maximum complementary second Zagreb index among all graphs of order $ n $ is
Hui Gao
doaj +1 more source
From omics to AI—mapping the pathogenic pathways in type 2 diabetes
FEBS Letters, EarlyView.Integrating multi‐omics data with AI‐based modelling (unsupervised and supervised machine learning) identify optimal patient clusters, informing AI‐driven accurate risk stratification. Digital twins simulate individual trajectories in real time, guiding precision medicine by matching patients to targeted therapies.
Siobhán O'Sullivan +2 more
wiley +1 more source
Multi-Scale Mixed Dense Graph Convolution Network for Skeleton-Based Action Recognition
IEEE Access, 2021 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
On the causal interpretation of acyclic mixed graphs under multivariate normality [PDF]
, 2013 In multivariate statistics, acyclic mixed graphs with directed and bidirected edges are widely used for compact representation of dependence structures that can arise in the presence of hidden (i.e., latent or unobserved) variables.
Drton, Mathias +2 more
core