Results 1 to 10 of about 282,172 (197)

Mixed Graph Colorings: A Historical Review

open access: yesMathematics, 2020
This paper presents a historical review and recent developments in mixed graph colorings in the light of scheduling problems with the makespan criterion. A mixed graph contains both a set of arcs and a set of edges. Two types of colorings of the vertices
Yuri N. Sotskov
doaj   +4 more sources

Total mixed domination in graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2022
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   +3 more sources

Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2)

open access: yesFrontiers in Physics, 2020
Let Γ = (V, E) be a connected graph. A vertex i ∈ V recognizes two elements (vertices or edges) j, k ∈ E ∩ V, if dΓ(i, j) ≠ dΓ(i, k). A set S of vertices in a connected graph Γ is a mixed metric generator for Γ if every two distinct elements (vertices or
Hassan Raza, Ying Ji
doaj   +3 more sources

Inverse neutrosophic mixed graphs [PDF]

open access: yesJournal of Fuzzy Extension and Applications
This article successfully attempts to introduce the notion of Inverse Neutrosophic Mixed Graphs (INMG) together with its applications. This novel approach highlights the network modeling of real physical situations with indeterminacy.
Thempaavai Jayaprakash   +1 more
doaj   +2 more sources

Moore mixed graphs from Cayley graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2023
A Moore (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in- and out-degree z, diameter k, and number of vertices (or order) attaining the corresponding Moore bound M(r, z, k) for mixed graphs. When the order of G is close to M(
Cristina Dalfo, Miquel Àngel Fiol
doaj   +3 more sources

A Cooperative Merging Method for Mixed Traffic Based on Enhanced Graph Reinforcement Learning with Vehicle Collaboration Graphs [PDF]

open access: yesSensors
Achieving cooperative perception and decision-making among connected and autonomous vehicles (CAVs) in mixed-traffic ramp merge scenarios is crucial for building a swarm intelligence-based traffic control system.
Haifeng Guo   +5 more
doaj   +2 more sources

Large language model-driven knowledge graph reasoning for enhanced semantic segmentation [PDF]

open access: yesScientific Reports
Urban scene segmentation is essential for 3D city modeling and plays a crucial role in various remote sensing applications, including urban planning and environmental monitoring.
Jinhe Su   +6 more
doaj   +2 more sources

𝕮-inverse of graphs and mixed graphs

open access: yesOpen Mathematics
This article introduces a generalization of the concept of inverse graphs applicable to both graphs and mixed graphs. Given a graph GG with adjacency matrix A(G)A\left(G), the inverse graph G−1{G}^{-1} is defined such that its adjacency matrix is similar
Alomari Omar   +2 more
doaj   +2 more sources

The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2022
A mixed graph is a set of vertices together with an edge set and an arc set. An $(m,n)$-mixed graph $G$ is a mixed graph whose edges are each assigned one of $m$ colours, and whose arcs are each assigned one of $n$ colours. A \emph{switch} at a vertex $v$
Richard C Brewster   +2 more
doaj   +1 more source

The Spectral Distribution of Random Mixed Graphs

open access: yesAxioms, 2022
In this work, we propose a random mixed graph model Gn(p(n),q(n)) that incorporates both the classical Erdős-Rényi’s random graph model and the random oriented graph model.
Yue Guan   +7 more
doaj   +1 more source

Home - About - Disclaimer - Privacy