Results 71 to 80 of about 282,172 (197)
On Mixed Metric Dimension of Some Path Related Graphs
IEEE Access, 2020 A vertex $k\in V_{G}$ determined two elements (vertices or edges) $\ell,m \in V_{G}\cup E_{G}$ , if $d_{G}(k,\ell)\neq d_{G}(k,m)$ . A set $R_ {\text {m}}$ of vertices in a graph $G$ is a mixed metric generator for $G$ , if two distinct elements
Hassan Raza, Ying Ji, Shaojian Qu
doaj +1 more source
A note on orientations of mixed graphs
Discrete Applied Mathematics, 2002 The authors study an orientation problem on mixed graphs. The goal is to obtain a directed graph satisfying a certain connectivity requirement. First the authors continue the study of the pair connectivity problem and show that it is NP-complete for mixed graphs. Then they prove several results for two pairs of nodes of mixed graphs.
Esther M. Arkin, Refael Hassin
openaire +1 more source
Improved Approximation for Orienting Mixed Graphs [PDF]
Algorithmica, 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 source-target path.
Iftah Gamzu, Moti Medina
openaire +4 more sources
, 2004 A k-stack layout (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. A k-track layout of a graph consists of
David R. Wood +3 more
core +1 more source
On Chromatic Number of Colored Mixed Graphs [PDF]
, 2017 An $(m,n)$-colored mixed graph $G$ is a graph with its arcs having one of the $m$ different colors and edges having one of the $n$ different colors. A homomorphism $f$ of an $(m,n)$-colored mixed graph $G$ to an $(m,n)$-colored mixed graph $H$ is a vertex mapping such that if $uv$ is an arc (edge) of color $c$ in $G$, then $f(u)f(v)$ is an arc (edge ...
Sandip Das 0001 +2 more
openaire +2 more sources
Mixed graph edge coloring [PDF]
, 2019 We are interested in coloring the edges of a mixed graph, i.e., a graph containing unoriented and oriented edges. This problem is related to a communication problem in job-shop scheduling systems.
Żyliński, Paweł +3 more
core
A Mixed Graph Achieving A Moore-like Bound
, 2023 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 we construct a mixed cage of order 30 that achieves the mixed graph analogue of the Moore bound for ...
Exoo, Geoffrey
core
Mixed Upward Planarization - Fast and Robust
, 2006 In a mixed upward drawing of a graph G=(V,E) all directed edges E_D \subseteq E are represented by monotonically increasing curves. Mixed upward drawings arise in applications like UML diagrams where such edges denote a hierarchical structure.
Martin Siebenhaller +3 more
core +1 more source
On eigenvectors of mixed graphs with exactly one nonsingular cycle [PDF]
, 1998 summary:Let $G$ be a mixed graph. The eigenvalues and eigenvectors of $G$ are respectively defined to be those of its Laplacian matrix. If $G$ is a simple graph, [M.
Fan, Yi-Zheng +2 more
core +1 more source
m-step inverse fuzzy mixed competition graphs
International Journal of Mathematics for IndustryThe notion of competition graphs has a wide range of applications and has been utilized in designing various ecological problems and real-world competitions.
Rahul Mondal, Ganesh Ghorai
doaj +1 more source