Results 31 to 40 of about 208,068 (260)
A Study on Semi-directed Graphs for Social Media Networks
In the literature of graph theory, networks are represented as directed graphs or undirected graphs and a mixed of both combinations. In today's era of computing, networks like brain and facebook that do not belong to any of the mentioned networks ...
Sovan Samanta +4 more
doaj +1 more source
Stochastic and mixed flower graphs [PDF]
11 pages, 6 ...
C. Tyler Diggans +2 more
openaire +3 more sources
In this study, in order to explore ways that statistical graphs teaching in elementary mathematics education can be improved, first, the types of statistical graphs that appear in middle school social textbooks were examined, and second, the ...
Byungjoo Tak, Eun-Sung Ko
doaj +1 more source
Research and Application of Hypernetwork Energy
Graph energy plays an important role in research of graph theory. Graph energy and many other similar variants have been applied in many other types of graphs, e.g., undirected graphs, oriented graphs, mixed graphs, and so on.
LIU Shengjiu, LI Tianrui, LIU Jia, XIE Peng
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
Best Graph Type to Compare Discrete Groups: Bar, Dot, and Tally
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
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
Mixed metric dimension of graphs [PDF]
arXiv admin note: text overlap with arXiv:1602 ...
Aleksander Kelenc +3 more
openaire +3 more sources
On the Mixed Minus Domination in Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Baogen, Kong, Xiangyang
openaire +1 more source

