Results 11 to 20 of about 67,461 (315)
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
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
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
Structures devised by the generalizations of two graph operations and their topological descriptors
Graph theory served in different fields of sciences, especially in chemistry in which creating complex structures and studying their enormous properties. Graph operation is a tool to construct complex chemical structures using basic graphs.
Raza Hassan +3 more
doaj +1 more source
OPERATIONS ON SPECTRAL FUZZY GRAPHS
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]
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
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
Operator Machines on Directed Graphs [PDF]
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
几个图运算下的图的惯性指数的界(Bounding the inertia of graphs under some graph operations)
The inertia of a graph G is defined to be the triple In(G) = {i+ (G), i- (G),i0 (G)},where i+ (G),i-(G),i0 (G) are the numbers of positive,negative and zero eigenvalues of the adjacency matrix A(G) including multiplicities, respectively.
QUHui(曲慧), LIUWeijun(刘伟俊)
doaj +1 more source
On Powers of Some Graph Operations [PDF]
Let G*H be the product * of G and H. In this paper we determine the rth power of the graph G*H in terms of Gr, Hrand Gr*Hr, when * is the join, Cartesian, symmetric difference, disjunctive, composition, skew and corona product. Then we solve the equation
Mohamed Seoud, Hamdy Mohamed Hafez
doaj +1 more source

