Results 1 to 10 of about 4,266 (88)
Graphs of low chordality [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. The odd (even) chordality is defined to be the length of the longest induced odd (even) cycle in it. Chordal graphs have chordality at most 3.
Sunil Chandran +2 more
doaj +3 more sources
Neutrosophic Circular-arc Graphs and Proper circular-arc Graphs [PDF]
Neutrosophic Sets and SystemsGraph theory is a fundamental branch of mathematics that studies networks made up of nodes (vertices) and connections (edges). A key concept in graph theory is the intersection graph, where vertices represent sets, and edges are drawn between vertices if
Florentin Smarandache, Takaaki Fujita
doaj +1 more source
On coherent configuration of circular-arc graphs [PDF]
Communications in Combinatorics and OptimizationFor any graph, Weisfeiler and Leman assigned the smallest matrix algebra which contains the adjacency matrix of the graph. The coherent configuration underlying this algebra for a graph $\Gamma$ is called the coherent configuration of $\Gamma ...
Fatemeh Raei Barandagh +1 more
doaj +1 more source
Drawing Graphs on Few Circles and Few Spheres
Journal of Graph Algorithms and Applications, 2019 Given a drawing of a graph, its visual complexity is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in 2D).
Myroslav Kryven +2 more
doaj +1 more source
Triangulations with Circular Arcs
Journal of Graph Algorithms and Applications, 2015 An important objective in the choice of a triangulation of a given point set is that the smallest angle becomes as large as possible. When triangulation edges are straight line segments, it is known that the Delaunay triangulation is the optimal solution.
Oswin Aichholzer +5 more
doaj +1 more source
Journal of Graph Algorithms and Applications, 2015 Let G=(V,E) be a planar graph. An arrangement of circular arcs is called a composite arc-drawing of G, if its 1-skeleton is isomorphic to G. Similarly, a composite segment-drawing is described by an arrangement of straight-line segments.
André Schulz
doaj +1 more source
Journal of Graph Algorithms and Applications, 2013 We study the problem of creating smooth orthogonal layouts for planar graphs. While in traditional orthogonal layouts every edge is made of a sequence of axis-aligned line segments, in smooth orthogonal layouts every edge is made of axis-aligned segments
Michael Bekos +3 more
doaj +1 more source
A High-Robust Automatic Reading Algorithm of Pointer Meters Based on Text Detection
Sensors, 2020 Automatic reading of pointer meters is of great significance for efficient measurement of industrial meters. However, existing algorithms are defective in the accuracy and robustness to illumination shooting angle when detecting various pointer meters ...
Zhu Li +4 more
doaj +1 more source
Universal Point Sets for Drawing Planar Graphs with Circular Arcs
Journal of Graph Algorithms and Applications, 2014 We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a planar drawing in which every vertex of G is placed on a distinct point of S and every edge of G is drawn as a circular arc.
Patrizio Angelini +7 more
doaj +1 more source
Simple Algorithms for Network Visualization: A Tutorial
Tsinghua Science and Technology, 2012 The graph drawing and information visualization communities have developed many sophisticated techniques for visualizing network data, often involving complicated algorithms that are difficult for the uninitiated to learn.
Michael J. McGuffin
doaj +1 more source