Results 31 to 40 of about 278,151 (262)
ON SPECTRA OF HERMITIAN RANDIĆ MATRIX OF SECOND KIND [PDF]
Let $X$ be a mixed graph and $\omega=\frac{1+\i \sqrt{3}}{2}$. We write $i\rightarrow j$, if there is an oriented edge from a vertex $v_i$ to another vertex $v_j$, and $i\sim j$ for an un-oriented edge between the vertices $v_i$ and $v_j$.
A Bharali +3 more
doaj +1 more source
Uniform Mixing on Cayley Graphs
We provide new examples of Cayley graphs on which the quantum walks reach uniform mixing. Our first result is a complete characterization of all $2(d+2)$-regular Cayley graphs over $\mathbb{Z}_3^d$ that admit uniform mixing at time $2\pi/9$. Our second result shows that for every integer $k\ge 3$, we can construct Cayley graphs over $\mathbb{Z}_q^d ...
Chris D. Godsil, Hanmeng Zhan
openaire +3 more sources
A Comparative Study of Three Resolving Parameters of Graphs
Graph theory is one of those subjects that is a vital part of the digital world. It is used to monitor the movement of robots on a network, to debug computer networks, to develop algorithms, and to analyze the structural properties of chemical structures,
Hafiz Muhammad Ikhlaq +2 more
doaj +1 more source
Parameterized Mixed Graph Coloring [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Mixed Moore Cayley Graphs [PDF]
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected edges and directed arcs in the graph.
openaire +2 more sources
On the Spectra of General Random Mixed Graphs [PDF]
A mixed graph is a graph that can be obtained from a simple undirected graph by replacing some of the edges by arcs in precisely one of the two possible directions. The Hermitian adjacency matrix of a mixed graph $G$ of order $n$ is the $n \times n$ matrix $H(G)=(h_{ij})$, where $h_{ij}=-h_{ji}= \boldsymbol{\mathrm{i}}$ (with $\boldsymbol{\mathrm{i}} =\
Dan Hu +3 more
openaire +2 more sources
On the Upward Planarity of Mixed Plane Graphs
A mixed plane graph is a plane graph whose edge set is partitioned into a set of directed edges and a set of undirected edges. An orientation of a mixed plane graph G is an assignment of directions to the undirected edges of G resulting in a directed ...
Fabrizio Frati +4 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
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 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

