Log in

Relevant bibliographies by topics / Transformation graph / Journal articles

To see the other types of publications on this topic, follow the link: Transformation graph.

Journal articles on the topic 'Transformation graph'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Transformation graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

RAFE, VAHID, and ADEL T. RAHMANI. "A NOVEL APPROACH TO VERIFY GRAPH SCHEMA-BASED SOFTWARE SYSTEMS." International Journal of Software Engineering and Knowledge Engineering 19, no. 06 (2009): 857–70. http://dx.doi.org/10.1142/s0218194009004398.

Full text

Abstract:

Graph Grammars have recently become more and more popular as a general formal modeling language. Behavioral modeling of dynamic systems and model to model transformations are a few well-known examples in which graphs have proven their usefulness in software engineering. A special type of graph transformation systems is layered graphs. Layered graphs are a suitable formalism for modeling hierarchical systems. However, most of the research so far concentrated on graph transformation systems as a modeling means, without considering the need for suitable analysis tools. In this paper we concentrat

APA, Harvard, Vancouver, ISO, and other styles

2

Wang, Haiying, Jia-Bao Liu, Shaohui Wang, et al. "Sharp Bounds for the General Sum-Connectivity Indices of Transformation Graphs." Discrete Dynamics in Nature and Society 2017 (2017): 1–7. http://dx.doi.org/10.1155/2017/2941615.

Full text

Abstract:

Given a graph G, the general sum-connectivity index is defined as χα(G)=∑uv∈E(G)dGu+dGvα, where dG(u) (or dG(v)) denotes the degree of vertex u (or v) in the graph G and α is a real number. In this paper, we obtain the sharp bounds for general sum-connectivity indices of several graph transformations, including the semitotal-point graph, semitotal-line graph, total graph, and eight distinct transformation graphs Guvw, where u,v,w∈+,-.

APA, Harvard, Vancouver, ISO, and other styles

3

Durgun, Derya, and Busra Ozen-Dortok. "Packing chromatic number of transformation graphs." Thermal Science 23, Suppl. 6 (2019): 1991–95. http://dx.doi.org/10.2298/tsci190720363d.

Full text

Abstract:

Graph coloring is an assignment of labels called colors to elements of a graph. The packing coloring was introduced by Goddard et al. [1] in 2008 which is a kind of coloring of a graph. This problem is NP-complete for general graphs. In this paper, we consider some transformation graphs and generalized their packing chromatic numbers.

APA, Harvard, Vancouver, ISO, and other styles

4

Luo, Haichang, Sakander Hayat, Yubin Zhong, Zhongyuan Peng, and Tamás Réti. "The IRC Indices of Transformation and Derived Graphs." Mathematics 10, no. 7 (2022): 1111. http://dx.doi.org/10.3390/math10071111.

Full text

Abstract:

An irregularity index IR(Γ) of a graph Γ is a nonnegative numeric quantity (i.e., IR(Γ)≥0) such that IR(Γ)=0 iff Γ is a regular graph. In this paper, we show that IRC closely correlates with the normal boiling point Tbp and the standard heat of formation ΔHfo of lower benzenoid hydrocarbons. The correlation models that fit the data efficiently for both Tbp and ΔHfo are linear. We develop further mathematical properties of IRC by calculating its exact expressions for the recently introduced transformation graphs as well as certain derived graphs, such as the total graph, semi-total point graph,

APA, Harvard, Vancouver, ISO, and other styles

5

Vidyashree H. R. "Some Derived Graphs of Ananta-Graphs." Panamerican Mathematical Journal 35, no. 3s (2025): 522–27. https://doi.org/10.52783/pmj.v35.i3s.4246.

Full text

Abstract:

Graph theory provides powerful tools for analyzing mathematical structures and sequences. The Ananta-graph, derived from the Collatz conjecture, represents integer transformations through directed edges, capturing number relationships under n→3n+1 and n→n/2 operations. This paper explores several derived graphs from the Ananta-graph, including line, middle, Mycielskian, subdivision, total, core, power, splitting and kernel graph, analyzing their structural properties and mathematical significance. By analyzing these derived graphs, we provide deeper insights into the topological, algebraic and

APA, Harvard, Vancouver, ISO, and other styles

6

Bagga, Jay. "Old and new generalizations of line graphs." International Journal of Mathematics and Mathematical Sciences 2004, no. 29 (2004): 1509–21. http://dx.doi.org/10.1155/s0161171204310094.

Full text

Abstract:

Line graphs have been studied for over seventy years. In 1932, H. Whitney showed that for connected graphs, edge-isomorphism implies isomorphism except forK3andK1,3. The line graph transformation is one of the most widely studied of all graph transformations. In its long history, the concept has been rediscovered several times, with different names such as derived graph, interchange graph, and edge-to-vertex dual. Line graphs can also be considered as intersection graphs. Several variations and generalizations of line graphs have been proposed and studied. These include the concepts of total g

APA, Harvard, Vancouver, ISO, and other styles

7

BUSATTO, GIORGIO, HANS-JÖRG KREOWSKI, and SABINE KUSKE. "Abstract hierarchical graph transformation." Mathematical Structures in Computer Science 15, no. 4 (2005): 773–819. http://dx.doi.org/10.1017/s0960129505004846.

Full text

Abstract:

In this paper we introduce a new hierarchical graph model to structure large graphs into small components by distributing the nodes (and, likewise, edges) into a hierarchy of packages. In contrast to other known approaches, we do not fix the type of underlying graphs. Moreover, our model is equipped with a rule-based transformation concept such that hierarchical graphs are not restricted to being used only for the static representation of complex system states, but can also be used to describe dynamic system behaviour.

APA, Harvard, Vancouver, ISO, and other styles

8

Basavanagoud, B., та Jaishri B. Veeragoudar. "A Criterion for (Non-)Planarity of The Block-Transformation Graph G^αβγ when αβγ = 101". Bulletin of Mathematical Sciences and Applications 10 (листопад 2014): 38–47. http://dx.doi.org/10.18052/www.scipress.com/bmsa.10.38.

Full text

Abstract:

The general concept of the block-transformation graph Gαβγ was introduced in [1]. The vertices and blocks of a graph are its members. The block-transformation graph G101 of a graph G is the graph, whose vertex set is the union of vertices and blocks of G, in which two vertices are adjacent whenever the corresponding vertices of G are adjacent or the corresponding blocks of G are nonadjacent or the corresponding members of G are incident. In this paper, we present characterizations of graphs whose block-transformation graphs G101 are planar, outerplanar or minimally nonouterplanar. Further we e

APA, Harvard, Vancouver, ISO, and other styles

9

Mirajkar, Keerthi G., and Y. B. Priyanka. "The Sum Degree Distance and the Product Degree Distance of Generalized Transformation Graphs G^ab." Bulletin of Mathematical Sciences and Applications 16 (August 2016): 76–88. http://dx.doi.org/10.18052/www.scipress.com/bmsa.16.76.

Full text

Abstract:

In this contribution, we consider line splitting graph LS(G) of a graph G as transformation graph G++ of Gab. We investigate the sum degree distance DD+(G) and product degree distance DD*(G) of transformation graph Gab, which are weighted version of Wiener index. The Transformation graphs of Gab are G++, G+-, G-+ and G--.

APA, Harvard, Vancouver, ISO, and other styles

10

Imran, Muhammad, Shehnaz Akhter, and Hani Shaker. "Sharp bounds for the general Randić index of transformation graphs." Journal of Intelligent & Fuzzy Systems 39, no. 5 (2020): 7787–94. http://dx.doi.org/10.3233/jifs-201139.

Full text

Abstract:

Inequalities are a useful method to investigate and compare topological indices of graphs relatively. A large collection of graph associated numerical descriptors have been used to examine the whole structure of networks. In these analysis, degree related topological indices have a significant position in theoretical chemistry and nanotechnology. Thus, the computation of degree related indices is one of the successful topic of research. Given a molecular graph H , the general Randić connectivity index is interpreted as R α ( H ) = ∑ ℛ ∈ E ( H ) ( deg H ( a ) deg H ( b ) ) α , with α is a real

APA, Harvard, Vancouver, ISO, and other styles

11

Holdsworth, Jason J. "Graph traversal and graph transformation." Theoretical Computer Science 321, no. 2-3 (2004): 215–31. http://dx.doi.org/10.1016/j.tcs.2004.03.034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Bonifati, Angela, Yann Ramusat, Filip Murlak, Amela Fejza, and Rachid Echahed. "DTGraph: Declarative Transformations of Property Graphs." Proceedings of the VLDB Endowment 17, no. 12 (2024): 4265–68. http://dx.doi.org/10.14778/3685800.3685851.

Full text

Abstract:

Current graph query languages, including the standards SQL/PGQ and GQL, define their semantics in terms of sets of tuples. This is largely inadequate for data interoperability tasks such as data migration or data integration which require queries to output new property graphs. This demonstration showcases DTGraph, an open-source declarative rule-based framework for easily specifying and efficiently executing property graph transformations. We describe a novel comprehensive system that allows the declarative specification of property graph transformations, by extending openCypher queries with a

APA, Harvard, Vancouver, ISO, and other styles

13

TUNÇEL GÖLPEK, Hande. "Results of Paired Domination of Some Special Graph Families on Transformation Graphs: $G^{xy+}$ and $G^{xy-}$." Journal of New Theory, no. 44 (September 30, 2023): 52–61. http://dx.doi.org/10.53570/jnt.1337633.

Full text

Abstract:

In this study, transformation graphs obtained from the concept of the total graph and the result of its paired domination number for some special graph families are discussed. If a subset $S$ of the vertex set of the graph $G$ dominates and the induced subgraph $⟨S⟩$ has a perfect matching that covers every vertex of the graph, then $S$ is called a paired-dominating set of $G$. A paired dominating set with the smallest cardinality is denoted by $\gamma_{pr}$-set. Haynes and Slater introduced paired domination parameters. The present study commences with assessing outcomes stemming from eight p

APA, Harvard, Vancouver, ISO, and other styles

14

Kaladevi, V., R. Murugesan, and K. Pattabiraman. "First reformulated Zagreb indices of some classes of graphs." Carpathian Mathematical Publications 9, no. 2 (2018): 134–44. http://dx.doi.org/10.15330/cmp.9.2.134-144.

Full text

Abstract:

A topological index of a graph is a parameter related to the graph; it does not depend on labeling or pictorial representation of the graph. Graph operations plays a vital role to analyze the structure and properties of a large graph which is derived from the smaller graphs. The Zagreb indices are the important topological indices found to have the applications in Quantitative Structure Property Relationship(QSPR) and Quantitative Structure Activity Relationship(QSAR) studies as well. There are various study of different versions of Zagreb indices. One of the most important Zagreb indices is t

APA, Harvard, Vancouver, ISO, and other styles

15

Bonifati, Angela, Filip Murlak, and Yann Ramusat. "Transforming Property Graphs." Proceedings of the VLDB Endowment 17, no. 11 (2024): 2906–18. http://dx.doi.org/10.14778/3681954.3681972.

Full text

Abstract:

In this paper, we study a declarative framework for specifying transformations of property graphs. In order to express such transformations, we leverage queries formulated in the Graph Pattern Calculus (GPC), which is an abstraction of the common core of recent standard graph query languages, GQL and SQL/PGQ. In contrast to previous frameworks targeting graph topology only, we focus on the impact of data values on the transformations---which is crucial in addressing users' needs. In particular, we study the complexity of checking if the transformation rules do not specify conflicting values fo

APA, Harvard, Vancouver, ISO, and other styles

16

M. Chougule, Neeta, and Unde D. B. "ON F*- INDEX OF FUZZY GENERALIZED TRANSFORMATION GRAPHS." Journal of Dynamics and Control 9, no. 4 (2025): 102–13. https://doi.org/10.71058/jodac.v9i4009.

Full text

Abstract:

The Fuzzy graphs serve as a practical tool in mathematics, enabling users to effortlessly represent relationships between various concepts. Their inherent fuzziness makes them adaptable and well- suited for diverse environments. A topological index is a numerical value that characterizes the structural graph of a molecule. This study aims to introduce a new topological index in the fuzzy graph theory and study its properties. In this direction, we have introduced -index of a fuzzy graph . In this paper, the -index of fuzzy generalized transformation graphs and its related bounds are studied.

APA, Harvard, Vancouver, ISO, and other styles

17

NATH, MILAN, and SOMNATH PAUL. "GRAPH TRANSFORMATION AND DISTANCE SPECTRAL RADIUS." Discrete Mathematics, Algorithms and Applications 05, no. 03 (2013): 1350014. http://dx.doi.org/10.1142/s1793830913500146.

Full text

Abstract:

Trees are very common in the theory and applications of combinatorics. In this paper, we consider graphs whose underlying structure is a tree and study the behavior of the distance spectral radius under a graph transformation. As an application, we find the corona tree that maximizes the distance spectral radius among all corona trees with a fixed maximum degree. We also find the graph with minimal (maximal) distance spectral radius among all corona trees. Finally, we determine the graph with minimal distance spectral radius in a special class of corona trees.

APA, Harvard, Vancouver, ISO, and other styles

18

Orejas, Fernando, and Leen Lambers. "Lazy Graph Transformation." Fundamenta Informaticae 118, no. 1-2 (2012): 65–96. http://dx.doi.org/10.3233/fi-2012-706.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Xu, Lan, and Baoyindureng Wu. "Transformation graph G-+-." Discrete Mathematics 308, no. 22 (2008): 5144–48. http://dx.doi.org/10.1016/j.disc.2007.09.040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Drewes, Frank, Berthold Hoffmann, and Detlef Plump. "Hierarchical Graph Transformation." Journal of Computer and System Sciences 64, no. 2 (2002): 249–83. http://dx.doi.org/10.1006/jcss.2001.1790.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Rensink, Arend, and Dino Distefano. "Abstract Graph Transformation." Electronic Notes in Theoretical Computer Science 157, no. 1 (2006): 39–59. http://dx.doi.org/10.1016/j.entcs.2006.01.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

De, Nilanjan. "Narumi–Katayama index of total transformation graphs." Discrete Mathematics, Algorithms and Applications 09, no. 03 (2017): 1750033. http://dx.doi.org/10.1142/s1793830917500331.

Full text

Abstract:

The Narumi–Katayama index of a graph was introduced in 1984 for representing the carbon skeleton of a saturated hydrocarbons and is defined as the product of degrees of all the vertices of the graph. In this paper, we examine the Narumi–Katayama index of different total transformation graphs.

APA, Harvard, Vancouver, ISO, and other styles

23

Nagarajan, S., and B. Aswini. "The Minimum Reduced Sombor Index of Unicyclic Graphs in Terms of the Girth." Asian Research Journal of Mathematics 21, no. 2 (2025): 48–54. https://doi.org/10.9734/arjom/2025/v21i2892.

Full text

Abstract:

Aims: The paper investigates the Reduced Sombor Index () for unicyclic graphs. Specifically, it aims to determine and characterize the unicyclic graphs that attain the minimum index among all unicyclic graphs of a given order. Study Design: This is a theoretical mathematical study based on graph theory and topological indices. The study involves defining and analyzing the Reduced Sombor Index by comparing values across different unicyclic graphs. Lemmas and theorems are proved to establish the minimum index graph. Methodology: Several graph transformation operations are analyzed. The study pro

APA, Harvard, Vancouver, ISO, and other styles

24

BACAK-TURAN, GOKSEN, and ALPAY KIRLANGIC. "NEIGHBOR INTEGRITY OF TRANSFORMATION GRAPHS." International Journal of Foundations of Computer Science 24, no. 03 (2013): 303–17. http://dx.doi.org/10.1142/s0129054113500056.

Full text

Abstract:

In a communication network, the vulnerability measures are essential to guide the designer in choosing an appropriate topology. They measure the stability of the network to disruption of operation after the failure of certain stations or communication links. If a station or operative is captured in a spy network, then the adjacent stations will be betrayed and are therefore useless in the whole network. In this sense, Margaret B. Cozzens and Shu-Shih Y. Wu modeled a spy network as a graph and then defined the neighbor integrity of a graph to obtain the vulnerability of a spy network [10]. The

APA, Harvard, Vancouver, ISO, and other styles

25

K. G., Nagarathnamma, and Leena N. Shenoy. "On Hamilton Laceability and Random Hamiltonian-t*– Laceablity of Total Transformation Graph G-++." Journal of Dynamics and Control 9, no. 5 (2025): 36–45. https://doi.org/10.71058/jodac.v9i5004.

Full text

Abstract:

A connected graph is called Hamiltonian if contains a spanning cycle and if a graph contains a spanning path between arbitrary pair of its vertices is called Hamilton-connected. A bipartite graph is called Hamilton-laceable if there exist Hamiltonian path between vertices of different partite sets and a graph is random Hamiltonian-– laceable if there exists a Hamiltonian path for at least one pair for distance. In this paper, we have studied the Hamiltonian laceble and random Hamiltonian-– laceable graphs of total transformation graph of graphs viz. path , cycle , complete bipartite graph , n-

APA, Harvard, Vancouver, ISO, and other styles

26

Rosselló, Francesc, and Gabriel Valiente. "Chemical Graphs, Chemical Reaction Graphs, and Chemical Graph Transformation." Electronic Notes in Theoretical Computer Science 127, no. 1 (2005): 157–66. http://dx.doi.org/10.1016/j.entcs.2004.12.033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Du, Wei, Hongmin Sun, Hang Gao, Gaoyang Li, and Ying Li. "Contrastive Auxiliary Learning with Structure Transformation for Heterogeneous Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 16 (2025): 16399–407. https://doi.org/10.1609/aaai.v39i16.33801.

Full text

Abstract:

In recent years, methods based on heterogeneous graph neural networks (HGNNs) have been widely used for embedding heterogeneous graphs (HGs) due to their ability to effectively encode the rich information from HGs into low-dimensional node embeddings. Existing HGNNs focus on neighbor aggregation and semantic fusion while neglecting the HG structure and learning paradigms. However, the original HG data might lack node features, which existing models may not effectively account for. Additionally, exclusively relying on a single supervised learning approach may only partially leverage the invaria

APA, Harvard, Vancouver, ISO, and other styles

28

Kraetzl, Miro, and Charles J. Colbourn. "Threshold Channel Graphs." Combinatorics, Probability and Computing 2, no. 3 (1993): 337–49. http://dx.doi.org/10.1017/s0963548300000717.

Full text

Abstract:

A transformation that increases the blocking probability of the channel graphs arising in interconnection networks is developed. This provides the basis for eminently computing a bound on the blocking probability by applying the transformation to reduce an arbitrary four-stage channel graph to a threshold channel graph. The four-stage channel graph that is most likely to block, given links that are equally likely to block, is characterized. Partial results are proved concerning the threshold channel graphs that are least likely to block.

APA, Harvard, Vancouver, ISO, and other styles

29

Schneider, Sven, Maria Maximova, Lucas Sakizloglou, and Holger Giese. "Formal testing of timed graph transformation systems using metric temporal graph logic." International Journal on Software Tools for Technology Transfer 23, no. 3 (2021): 411–88. http://dx.doi.org/10.1007/s10009-020-00585-w.

Full text

Abstract:

AbstractEmbedded real-time systems generate state sequences where time elapses between state changes. Ensuring that such systems adhere to a provided specification of admissible or desired behavior is essential. Formal model-based testing is often a suitable cost-effective approach. We introduce an extended version of the formalism of symbolic graphs, which encompasses types as well as attributes, for representing states of dynamic systems. Relying on this extension of symbolic graphs, we present a novel formalism of timed graph transformation systems (TGTSs) that supports the model-based deve

APA, Harvard, Vancouver, ISO, and other styles

30

Haneen Mohammed Adil and Israa Munir Tawfik. "On Some Types of Matrices for Fan Plane Graph and Their Dual." Tikrit Journal of Pure Science 28, no. 2 (2023): 104–7. http://dx.doi.org/10.25130/tjps.v28i2.1341.

Full text

Abstract:

This work aims to discuss the adjacency matrices, Incidence matrix and Degree matrix of some types plane graphs we usually used them, as complete graphs, cycle graph,…,ect. To find the dual of graph and transformation of the graph and their dual for some theorems to prove general cases.

APA, Harvard, Vancouver, ISO, and other styles

31

Nayyeri, Mojtaba, Sahar Vahdati, Can Aykul, and Jens Lehmann. "5* Knowledge Graph Embeddings with Projective Transformations." Proceedings of the AAAI Conference on Artificial Intelligence 35, no. 10 (2021): 9064–72. http://dx.doi.org/10.1609/aaai.v35i10.17095.

Full text

Abstract:

Performing link prediction using knowledge graph embedding models has become a popular approach for knowledge graph completion. Such models employ a transformation function that maps nodes via edges into a vector space in order to measure the likelihood of the links. While mapping the individual nodes, the structure of subgraphs is also transformed. Most of the embedding models designed in Euclidean geometry usually support a single transformation type -- often translation or rotation, which is suitable for learning on graphs with small differences in neighboring subgraphs. However, multi-rela

APA, Harvard, Vancouver, ISO, and other styles

32

CVETKOVIC, Dragoš, and Marija JEROTIJEVIC. "Compositions of Cospectrality Graphs of Smith Graphs." Kragujevac Journal of Mathematics 47, no. 2 (2023): 271–79. http://dx.doi.org/10.46793/kgjmat2302.271c.

Full text

Abstract:

Graphs whose spectrum belongs to the interval [−2, 2] are called Smith graphs. Vertices of the cospectrality graph C(H) of a Smith graph H are all graphs cospectral with H with two vertices adjacent if there exists a certain transformation transforming one to another. We study how the cospectrality graph of the union of two Smith graphs can be composed starting from cospectrality graphs of starting graphs.

APA, Harvard, Vancouver, ISO, and other styles

33

Pradeep Jha, Rajeshri Prajapati, Amit Parikh,. "Special Graphs of Euler’s Family* and Tracing Algorithm- (A New Approach)." Proceeding International Conference on Science and Engineering 11, no. 1 (2023): 2243–51. http://dx.doi.org/10.52783/cienceng.v11i1.400.

Full text

Abstract:

There are in graph theory, some known graphs which date back from centuries. [Euler graph, Hamiltonian graph etc.] These graphs are basic roots for development of graph theory. In this paper we have discussed the novel concept of tracing Euler tour. It depends on the concept of Link vertex - a join vertex of finite number of cycles as components of Euler graph. In addition to this, a new notion of isomorphic transformation of given graph on to a given line segment known as ‘Linear Graph’ also plays an important role for tracing the Euler graph.

APA, Harvard, Vancouver, ISO, and other styles

34

Asif, Muhammad, Hamad Almohamedh, Muhammad Hussain, Khalid M. Alhamed, Abdulrazaq A. Almutairi, and Sultan Almotairi. "An Approach to the Geometric-Arithmetic Index for Graphs under Transformations’ Fact over Pendent Paths." Complexity 2021 (June 24, 2021): 1–13. http://dx.doi.org/10.1155/2021/3745862.

Full text

Abstract:

Graph theory is a dynamic tool for designing and modeling of an interconnection system by a graph. The vertices of such graph are processor nodes and edges are the connections between these processors nodes. The topology of a system decides its best use. Geometric-arithmetic index is one of the most studied graph invariant to characterize the topological aspects of underlying interconnection networks or graphs. Transformation over graph is also an important tool to define new network of their own choice in computer science. In this work, we discuss transformed family of graphs. Let Γ n k , l b

APA, Harvard, Vancouver, ISO, and other styles

35

Zhao, Xiaojuan, Aiping Li, Rong Jiang, Kai Chen, and Zhichao Peng. "Householder Transformation-Based Temporal Knowledge Graph Reasoning." Electronics 12, no. 9 (2023): 2001. http://dx.doi.org/10.3390/electronics12092001.

Full text

Abstract:

Knowledge graphs’ reasoning is of great significance for the further development of artificial intelligence and information retrieval, especially for reasoning over temporal knowledge graphs. The rotation-based method has been shown to be effective at modeling entities and relations on a knowledge graph. However, due to the lack of temporal information representation capability, existing approaches can only model partial relational patterns and they cannot handle temporal combination reasoning. In this regard, we propose HTTR: Householder Transformation-based Temporal knowledge graph Reasoning

APA, Harvard, Vancouver, ISO, and other styles

36

HABEL, ANNEGRET, and KARL-HEINZ PENNEMANN. "Correctness of high-level transformation systems relative to nested conditions." Mathematical Structures in Computer Science 19, no. 2 (2009): 245–96. http://dx.doi.org/10.1017/s0960129508007202.

Full text

Abstract:

In this paper we introduce the notions of nested constraints and application conditions, short nested conditions. For a category associated with a graphical representation such as graphs, conditions are a graphical and intuitive, yet precise, formalism that is well suited to describing structural properties. We show that nested graph conditions are expressively equivalent to first-order graph formulas. A part of the proof includes transformations between two satisfiability notions of conditions, namely-satisfiability and-satisfiability. We consider a number of transformations on conditions tha

APA, Harvard, Vancouver, ISO, and other styles

37

Kahl, Wolfram, and Frank Derichsweiler. "Declarative Term Graph Attribution for Program Generation." JUCS - Journal of Universal Computer Science 7, no. (1) (2001): 54–70. https://doi.org/10.3217/jucs-007-01-0054.

Full text

Abstract:

We show how the declarative spirit of attribute grammars can be employed to define an attribution mechanism for term graphs, where the non-uniqueness of inherited attributes demands an appropriately generalised treatment. Since term graphs are a useful data structure for symbolic computation systems such as theorem provers or program transformation systems, this mechanism provides a powerful means to generate concrete programs (and other relevant text or data structures) from their abstract term graph representations. We have implemented this declarative term graph attribution mechanism in the

APA, Harvard, Vancouver, ISO, and other styles

38

Sarunya, Kanjanawattana, and Kimura Masaomi. "BRAIN Journal - ANNSVM: A Novel Method for Graph-Type Classification by Utilization of Fourier Transformation, Wavelet Transformation, and Hough Transformation." BRAIN: Broad Research in Artificial Intelligence and Neuroscience 8, no. 2 (2017): 5–25. https://doi.org/10.5281/zenodo.1045375.

Full text

Abstract:

ABSTRACT Image classification plays a vital role in many areas of study, such as data mining and image processing; however, serious problems collectively referred to as the course of dimensionality have been encountered in previous studies as factors that reduce system performance. Furthermore, we also confront the problem of different graph characteristics even if graphs belong to same types. In this study, we propose a novel method of graph-type classification. Using our approach, we open up a new solution of high-dimensional images and address problems of different characteristics by conver

APA, Harvard, Vancouver, ISO, and other styles

39

Löbl, Matthias C., Love A. Pettersson, Stefano Paesani, and Anders S. Sørensen. "Transforming graph states via Bell state measurements." Quantum 9 (July 14, 2025): 1795. https://doi.org/10.22331/q-2025-07-14-1795.

Full text

Abstract:

Graph states are key resources for measurement-based quantum computing, which is particularly promising for photonic systems. Fusions are probabilistic Bell state measurements, measuring pairs of parity operators of two qubits. Fusions can be used to connect/entangle different graph states, making them a powerful resource for measurement-based and related fusion-based quantum computing. There are several different graph structures and types of Bell state measurements, yet the associated graph transformations have only been analyzed for specific cases. Here, we provide a full set of graph trans

APA, Harvard, Vancouver, ISO, and other styles

40

Corradini, Andrea, Hartmut Ehrig, Grzegorz Rozenberg, and Gabriele Taentzer. "Introduction." Mathematical Structures in Computer Science 12, no. 2 (2002): 111. http://dx.doi.org/10.1017/s0960129501003504.

Full text

Abstract:

This special issue of Mathematical Structures in Computer Science is devoted to the theory and applications of graph transformations. This research area dates back to the early seventies and is based on mathematical techniques from graph theory, algebra, logic and category theory. The theory of graph transformations has become attractive as a modelling and programming paradigm for complex graphical structures in a large variety of areas in computer science and for applications to other fields. During the Joint APPLIGRAPH/GETGRATS Workshop on Graph Transformation Systems (GRATRA 2000) – a satel

APA, Harvard, Vancouver, ISO, and other styles

41

Su, Jing, Hongyu Wang, and Bing Yao. "On Elegant Labelling and Magic Labelling of Large-Scale Graphs." Discrete Dynamics in Nature and Society 2022 (March 28, 2022): 1–10. http://dx.doi.org/10.1155/2022/6301674.

Full text

Abstract:

In this paper, we deduce the equivalence relationship among strongly c-elegant labelling, super-edge magic total labelling, edge antimagic total labelling, and super t , 1 -magical labelling. We study some properties of the graph with a strongly c-elegant labelling. On the basis of small-scale graphs with strongly c-elegant labelling, several types of large-scale graphs are constructed through graph operations, and we further prove the existence of their strongly c-elegant labelling. In addition, we also define a transformation of strongly c-elegant labelling, which provides a method for the t

APA, Harvard, Vancouver, ISO, and other styles

42

Palacz, Wojciech. "Algebraic hierarchical graph transformation." Journal of Computer and System Sciences 68, no. 3 (2004): 497–520. http://dx.doi.org/10.1016/s0022-0000(03)00064-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Kreowski, Hans-Jörg, Sabine Kuske, and Andy Schürr. "Nested Graph Transformation Units." International Journal of Software Engineering and Knowledge Engineering 07, no. 04 (1997): 479–502. http://dx.doi.org/10.1142/s0218194097000278.

Full text

Abstract:

In this paper, we introduce a new concept for the structured development of rule-based graph transformation systems that allows to build up large systems from small pieces in a modular way. The concept is called nested graph transformation unit and consists of a network of local graph transformation units. While each local unit provides a set of rules and control conditions (including input and output descriptions), the net reflects the import structure of the system where each local unit can use its direct neighbours without any restrictions. In particular, the import structure may contain cy

APA, Harvard, Vancouver, ISO, and other styles

44

Heckel, Reiko. "Learning Graph Transformation Rules." Electronic Proceedings in Theoretical Computer Science 374 (December 21, 2022): 2. http://dx.doi.org/10.4204/eptcs.374.2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Hofbauer, Franz. "Periodic points for piecewise monotonic transformations." Ergodic Theory and Dynamical Systems 5, no. 2 (1985): 237–56. http://dx.doi.org/10.1017/s014338570000287x.

Full text

Abstract:

AbstractPeriodic points of piecewise monotonic transformations are investigated using an oriented graph, whose closed paths represent the periodic orbits of the transformation. In the first part it is shown that the inverse of the ζ-function is a kind of characteristic polynomial of this graph, which is a power series if the graph is infinite. In the second part, the sets are determined, which can occur as{withandwhereTis a monotonic mod one transformation.

APA, Harvard, Vancouver, ISO, and other styles

46

Pattabiraman, K. "F-Indices and its coindices of some classes of graphs." Creative Mathematics and Informatics 26, no. 2 (2017): 201–10. http://dx.doi.org/10.37193/cmi.2017.02.09.

Full text

Abstract:

In this paper, first we investigate the basic properties of the F-index and its coindex of graph. Next we obtain the exact expression of F-indices and its coindices for bridge graph, chain graph and transformation of graph. Using some of these results, we have obtained the value of these indices for some important classes of chemical graphs.

APA, Harvard, Vancouver, ISO, and other styles

47

Boiret, Adrien, Cédric Eichler, Benjamin Nguyen, and Sara Taki. "Graph rewriting primitives for semantic graph databases sanitization." Computer Science and Information Systems, no. 00 (2024): 26. http://dx.doi.org/10.2298/csis230426026b.

Full text

Abstract:

Due to the rapid proliferation of data online, an important quantity of private or sensitive informations is being stored as linked data in graph databases (e.g., represented as RDF). For such databases to be shared without jeopardizing privacy, they must first undergo a process known as database sanitization. During this process, databases are transformed following graph transformations that are usually described informally or through ad-hoc processes. However, a more thourough formalization of these transformations would aid in analysing the sanitization process, ensuring its correctness, an

APA, Harvard, Vancouver, ISO, and other styles

48

Tunçel Gölpek, Hande, and Aysun Aytaç. "Computing closeness for some graphs." Acta Universitatis Sapientiae, Informatica 15, no. 2 (2023): 221–38. http://dx.doi.org/10.2478/ausi-2023-0015.

Full text

Abstract:

Abstract The analysis of networks involves several crucial parameters. In this paper, we consider the closeness parameter, which is based on the total distance between every pair of vertices. Initially, we delve into a discussion about the applicability of the closeness parameter to Mycielski graphs. Our findings are categorized based on the underlying graph’s diameter. The formula for calculating the closeness of a Mycielski graph is derived for graphs with a diameter of less than or equal to 4. Furthermore, we establish a sharp lower bound for the closeness of a Mycielski graph when the diam

APA, Harvard, Vancouver, ISO, and other styles

49

Kotulski, Leszek, and Barbara Strug. "Transactional Model of Graph Transformations in Computer Aided Design." Key Engineering Materials 572 (September 2013): 315–18. http://dx.doi.org/10.4028/www.scientific.net/kem.572.315.

Full text

Abstract:

Different types of graphs have successfully been used to represent different objects in design problems. Graph transformations are often used as a way to generate, update and modify such graphs. Typical use of graph productions assumes that change of a graph is done by applying a single transformation or a sequence of independent productions. Yet, in many real life design tasks the application of a production may depend on the possibility of applying other productions. Moreover the productions required to be applied usually only depend on the current graph so the set of productions cannot be d

APA, Harvard, Vancouver, ISO, and other styles

50

Asif, Muhammad, Muhammad Hussain, Hamad Almohamedh, Khalid M. Alhamed, and Sultan Almotairi. "An Approach to the Extremal Inverse Degree Index for Families of Graphs with Transformation Effect." Journal of Chemistry 2021 (February 28, 2021): 1–8. http://dx.doi.org/10.1155/2021/6657039.

Full text

Abstract:

The inverse degree index is a topological index first appeared as a conjuncture made by computer program Graffiti in 1988. In this work, we use transformations over graphs and characterize the inverse degree index for these transformed families of graphs. We established bonds for different families of n -vertex connected graph with pendent paths of fixed length attached with fully connected vertices under the effect of transformations applied on these paths. Moreover, we computed exact values of the inverse degree index for regular graph specifically unicyclic graph.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!