Results 21 to 30 of about 2,650,610 (297)
A graph rewriting programming language for graph drawing [PDF]
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 the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families.
Patil H.P., Pandiya Raj R.
doaj +1 more source
Relationship between chlorophyll-a, sea surface temperature, and sea surface salinity [PDF]
BACKGROUND AND OBJECTIVES: This study aimed to investigate the long-term relationship between chlorophyll-a, sea surface temperature, and sea surface salinity monthly from January 2015 to December 2021.
M. Hidayat +4 more
doaj +1 more source
Graph-based implicit knowledge discovery from architecture change logs [PDF]
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
In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source
Pragmatic Graph Rewriting Modifications [PDF]
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter +3 more
core +1 more source
The set chromatic numbers of the middle graph of graphs
AbstractFor a simple connected graphG, letc:V(G) → ℕ be a vertex coloring ofG,where adjacent vertices may be colored the same. The neighborhood color set of a vertexv, denoted byNC(v), is the set of colors of the neighbors ofv. The coloringcis called aset coloringprovided thatNC(u) ≠NC(v) for every pair of adjacent verticesuandvofG.
G R J Eugenio +2 more
openaire +1 more source
Compiler Optimization: A Case for the Transformation Tool Contest [PDF]
An optimizing compiler consists of a front end parsing a textual programming language into an intermediate representation (IR), a middle end performing optimizations on the IR, and a back end lowering the IR to a target representation (TR) built of ...
Sebastian Buchwald, Edgar Jakumeit
doaj +1 more source
Erratum Identification and corrections of the existing mistakes in the paper On the total graph of Mycielski graphs, central graphs and their covering numbers, Discuss. Math. Graph Theory 33 (2013) 361-371.
Forouhandeh S.F. +4 more
doaj +1 more source
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

