Results 71 to 80 of about 5,251,465 (203)
Graph Algorithm Animation with Grrr [PDF]
, 2000 We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers +3 more
core +1 more source
The Effect of Gestalt Laws of Perceptual Organization on the Comprehension of Three-Variable Bar and Line Graphs [PDF]
, 2013 Objective: We report three experiments investigating the ability of undergraduate college students to comprehend 2 × 2 "interaction" graphs from two-way factorial research designs.
Ali, Nadia, Peebles, David
core +1 more source
Genus Distribution for a Graph [PDF]
, 2009 In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan +2 more
core +1 more source
The line completion number of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2019 In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index r of a graph G, denoted by ℒr(G). The vertices of ℒr(G)are the r-subsets of E(G), and two vertices S and T are adjacent if there exist s∈S and t∈T such that s and ...
S.A. Tapadia, B.N. Waphare
doaj +1 more source
Relations between the distinguishing number and some other graph parameters [PDF]
ریاضی و جامعهA distinguishing coloring of a simple graph $G$ is a vertex coloring of $G$ which is preserved only by the identity automorphism of $G$. In other words, this coloring ``breaks'' all symmetries of $G$.
Bahman Ahmadi +1 more
doaj +1 more source
Graphs with odd and even distances between non-cut vertices [PDF]
Opuscula MathematicaWe prove that in a connected graph, the distances between non-cut vertices are odd if and only if it is the line graph of a strong unique independence tree.
Kateryna Antoshyna, Sergiy Kozerenko
doaj +1 more source
CoRRWe consider the problem of estimating graph limits, known as graphons, from observations of sequences of sparse finite graphs. In this paper we show a simple method that can shed light on a subset of sparse graphs. The method involves mapping the original graphs to their line graphs.
Sevvandi Kandanaarachchi, Cheng Soon Ong
openaire +2 more sources
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liming Xiong, Minmin Zong
openaire +3 more sources
The n-th Power Signed Graphs-II [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required.
Reddyy, P. Siva Kota +2 more
core +1 more source
Discrete Mathematics, 1991 First the author shows that the answers to two questions due to A. Neumaier are `No'. Then he shows how to modifiy the second question in order to obtain an affirmative answer. In fact he proves (in design theoretical terminology) the following: Let \(G\) be some (connected) graph where each neighborhood induces a line graph and where each edge is ...
openaire +1 more source