Results 51 to 60 of about 2,542,324 (299)
Plick Graphs with Crossing Number 1 [PDF]
, 2011 In this paper, we deduce a necessary and sufficient condition for graphs whose plick graphs have crossing number 1. We also obtain a necessary and sufficient condition for plick graphs to have crossing number 1 in terms of forbidden ...
Basavanagoud, B., Kulli, V.R.
core +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
An Approach for Mixed Upward Planarization
Journal of Graph Algorithms and Applications, 2003 In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization problem for undirected graphs and is motivated by ...
Markus Eiglsperger +2 more
doaj +1 more source
On the Upward Planarity of Mixed Plane Graphs
Journal of Graph Algorithms and Applications, 2014 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
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
On large regular ( 1 , 1 , k ) -mixed graphs [PDF]
An (r,z,k)-mixed graph G has every vertex with undirected degree r, directed in- and out-degree z, and diameter k. In this paper, we study the case r = z = 1, proposing some new constructions of (1,1,k)-mixed graphs with a large number of vertices N. Our
Erskine, Grahame +13 more
core +1 more source
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
Mixing colourings in 2K2-free graphs
Discrete Mathematics, 2022 4 pages, 2 ...
Carl Feghali, Owen D. Merkel
openaire +2 more sources
Open Distance-Pattern Uniform Graphs [PDF]
, 2009 All graphs considered in this paper are finite, simple, undirected and connected. For graph theoretic terminology we refer to Harary [6].
Jose, Bibin K.
core +1 more source
Smarandachely t-path step signed graphs [PDF]
, 2010 Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed ...
Reddy, Siva Kota +5 more
core +1 more source