Results 41 to 50 of about 712,475 (276)

Mixed Moore Cayley Graphs [PDF]

Journal of Interconnection Networks, 2017
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 Mixed Minus Domination in Graphs [PDF]

Journal of the Operations Research Society of China, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Baogen, Kong, Xiangyang
openaire   +1 more source

Best Graph Type to Compare Discrete Groups: Bar, Dot, and Tally

Frontiers in Psychology, 2021
Different graph types might differ in group comparison due to differences in underlying graph schemas. Thus, this study examined whether graph schemas are based on perceptual features (i.e., each graph has a specific schema) or common invariant ...
Fang Zhao, Robert Gaschler
doaj   +1 more source

Uniform Mixing on Cayley Graphs

The Electronic Journal of Combinatorics, 2017
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

On the Spectra of General Random Mixed Graphs [PDF]

The Electronic Journal of Combinatorics, 2021
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, Hajo Broersma, Jiangyou Hou, Shenggui Zhang   +3 more
openaire   +2 more sources

Mixed metric dimension of graphs [PDF]

Applied Mathematics and Computation, 2017
arXiv admin note: text overlap with arXiv:1602 ...
Aleksander Kelenc, Dorota Kuziak, Andrej Taranenko, Ismael González Yero   +3 more
openaire   +3 more sources

On Mixed Metric Dimension of Rotationally Symmetric Graphs

IEEE Access, 2020
A vertex u ∈ V(G) resolves (distinguish or recognize) two elements (vertices or edges) v, w ∈ E(G)UV(G) if dG(u, v) ≠ dG(u, w) . A subset Lm of vertices in a connected graph G is called a mixed metric generator for G if every two ...
Hassan Raza, Jia-Bao Liu, Shaojian Qu
doaj   +1 more source

Reduction and evaluation of two-loop graphs with arbitrary masses [PDF]

, 2000
We describe a general analytic-numerical reduction scheme for evaluating any 2-loop diagrams with general kinematics and general renormalizable interactions, whereby ten special functions form a complete set after tensor reduction.
A. Ghinculov, A. Ghinculov, A. Ghinculov, A. Ghinculov, A. Ghinculov, A. Ghinculov, A. Ghinculov, Adrian Ghinculov, C. Anastasiou, F.A. Berends, G. Weiglein, J. Fleischer, J. Fleischer, J.A.M. Vermaseren, J.A.M. Vermaseren, J.A.M. Vermaseren, J.B. Tausk, J.J. van der Bij, R. Harlander, S. Bauberger, S. Bauberger, V.A. Smirnov, V.A. Smirnov, York-Peng Yao, Z. Bern   +24 more
core   +2 more sources

Mixed unit interval graphs

Discrete Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mitre Costa Dourado, Van Bang Le, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter   +4 more
openaire   +2 more sources

A Concise Study of Some Superhypergraph classes [PDF]

Neutrosophic Sets and Systems
In graph theory, the hypergraph extends the traditional graph structure by allowing edges to connect multiple vertices, and this concept is further broadened by the superhypergraph.
Florentin Smarandache, Takaaki Fujita
doaj   +1 more source