Results 21 to 30 of about 723,682 (282)
Graph Algebras and Derived Graph Operations
Logics, 2023 We revise the definition of graph operations in [WDK2018] and adapt correspondingly the construction of graph term algebras. As a first contribution to a prospective research field Universal Graph Algebra, we generalize some basic concepts and results from algebras to graph algebras.
Uwe Wolter, Tam T. Truong
openaire +3 more sources
AIP Conference Proceedings, 2019 A graph labeling is an assignment of integers to the vertices, edges, or to both, and it is subject to certain conditions. In this paper, a new concept of graph labeling called binary operation labeling is introduced. Let G=(V, E) be a (n, m)-graph and let f: V(G) → 1, 2, …, n be a bijection.
Al-Harere, Manal Naji +1 more
openaire +2 more sources
Vertex-Based Topological Indices of Double and Strong Double Graph of Dutch Windmill Graph
Journal of Chemistry, 2021 A measurement of the molecular topology of graphs is known as a topological index, and several physical and chemical properties such as heat formation, boiling point, vaporization, enthalpy, and entropy are used to characterize them.
Muhammad Asad Ali +3 more
doaj +1 more source
Designing classes’ interfaces for neural network graph model
Труды Института системного программирования РАН, 2019 An approach to testing artificial neural networks is described. The model of neural network is based on graph theory, and operations that are used in theoretical works devoted to graphs, trees, paths, cycles, and circuits.
Yuri Leonidovich Karpov +4 more
doaj +1 more source
OPERATIONS ON SPECTRAL FUZZY GRAPHS
JOURNAL OF RAMANUJAN SOCIETY OF MATHEMATICS AND MATHEMATICAL SCIENCES, 2022 The operations in spectral fuzzy graphs such as Cartesian product, strong product, bipartite double, Kronecker product and Lexicographic product (composition) are analysed to elucidate the impact of eigenvalue spectra. Also, the properties are derived which delves the effect on spectral fuzzy graphs.
Buvaneswari, R., Priya, K. Senbaga
openaire +1 more source
Quadripartitioned Neutrosophic Graph Structures [PDF]
Neutrosophic Sets and Systems, 2022 The quadripartitioned neutrosophic set is the partition of indeterminacy function of the neutrosophic set into contradiction part and ignorance part.
S. Satham Hussain +5 more
doaj +1 more source
f-Polynomial on Some Graph Operations
Mathematics, 2019 Given any function f : Z + → R + , let us define the f-index I f ( G ) = ∑ u ∈ V ( G ) f ( d u ) and the f-polynomial P f ( G , x ) = ∑ u ∈ V ( G ) x 1 / f ( d u ) − 1 ,
Walter Carballosa +3 more
doaj +1 more source
Feynman motives of banana graphs [PDF]
, 2008 We consider the infinite family of Feynman graphs known as the "banana graphs" and compute explicitly the classes of the corresponding graph hypersurfaces in the Grothendieck ring of varieties as well as their Chern-Schwartz-MacPherson classes, using the
Aluffi, Paolo, Marcolli, Matilde
core +4 more sources
Dynamic Graphs on the GPU [PDF]
, 2020 We present a fast dynamic graph data structure for the GPU. Our dynamic graph structure uses one hash table per vertex to store adjacency lists and achieves 3.4–14.8x faster insertion rates over the state of the art across a diverse set of large datasets,
Ashkiani, Saman +3 more
core +1 more source
Operator Machines on Directed Graphs [PDF]
Integral Equations and Operator Theory, 2010 We show that if an infinite-dimensional Banach space X has a symmetric basis then there exists a bounded, linear operator R : X --> X such that the set A = {x in X : ||R^n(x)|| --> infinity} is non-empty and nowhere dense in X. Moreover, if x in X\A then some subsequence of (R^n(x)) converges weakly to x.
Hájek, P. (Petr Pavel), Smith, R.J.
openaire +3 more sources