Results 21 to 30 of about 1,324,556 (299)
, 2011 In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +1 more source
Towards a Maude tool for model checking temporal graph properties [PDF]
, 2011 We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto +4 more
core +1 more source
On an edge partition and root graphs of some classes of line graphs
Electronic Journal of Graph Theory and Applications, 2017 The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj +1 more source
WGT: Tools and algorithms for recognizing, visualizing, and generating Wheeler graphs
iScience, 2023 Summary: A Wheeler graph represents a collection of strings in a way that is particularly easy to index and query. Such a graph is a practical choice for representing a graph-shaped pangenome, and it is the foundation for current graph-based pangenome ...
Kuan-Hao Chao +3 more
doaj +1 more source
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
On almost self-complementary graphs
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Primoz Potocnik, Mateja Sajna
openaire +1 more source
COMPLEMENTARY DISTANCE SPECTRA AND COMPLEMENTARY DISTANCE ENERGY OF LINE GRAPHS OF REGULAR GRAPHS [PDF]
Journal of the Indonesian Mathematical Society, 2016 The complementary distance (CD) matrix of a graph $G$ is defined as $CD(G) = [c_{ij}]$, where $c_{ij} = 1+D-d_{ij}$ if $i \neq j$ and $c_{ij} = 0$, otherwise, where $D$ is the diameter of $G$ and $d_{ij}$ is the distance between the vertices $v_i$ and $v_j$ in $G$.
Ramane, Harishchandra S. +1 more
openaire +2 more sources
Graph-based implicit knowledge discovery from architecture change logs [PDF]
, 2012 Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344) +12 more
core +2 more sources
Homomorphisms and related contractions of graphs
International Journal of Mathematics and Mathematical Sciences, 1988 For every homomorphism ϕ of a graph G there exists a contraction θϕ on G¯, the complement of G. Here we study the graph equation ϕ(G)=θϕ(G¯). In the course of our work we show that Hadwiger's Conjecture is true for every self-complementary graph.
Robert D. Girse, Richard A. Gillman
doaj +1 more source
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources