Results 21 to 30 of about 2,773,301 (295)
, 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
Traversability and connectivity of the middle graph of a graph
Discrete Mathematics, 1976 AbstractWe define a graph M(G) as an intersection graph Ω(F) on the point set V(G) of any graph G. Let X(G) be the line set of G and F = V′(G) ∪ X(G), where V′(G) indicates the family of all one point subsets of the set V(G). Let M(G) = Ω(F). M(G) is called the middle graph of G. The following theorems result: 1.Theorem 1.
Takashi Hamada, Izumi Yoshimura
openaire +2 more sources
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
Discussiones Mathematicae Graph Theory, 2013 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]
Global Journal of Environmental Science and Management, 2023 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
The set chromatic numbers of the middle graph of graphs
Journal of Physics: Conference Series, 2021 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
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
Pragmatic Graph Rewriting Modifications [PDF]
, 1999 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
, 2023 Histograms of the transformed correlation coefficients between the RGB channels: ζ(1) (top graph), ζ(2) (middle graph), and ζ(3) (bottom graph).
Laura Rebollo-Neira (5638214) +1 more
core +1 more source
Compiler Optimization: A Case for the Transformation Tool Contest [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 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
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