Results 1 to 10 of about 67,461 (315)
The irregularity of graphs under graph operations
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G).
Abdo Hosam, Dimitrov Darko
doaj +4 more sources
Graph Operations and Neighborhood Polynomials
The neighborhood polynomial of graph G is the generating function for the number of vertex subsets of G of which the vertices have a common neighbor in G.
Alipour Maryam, Tittmann Peter
doaj +4 more sources
The total irregularity of graphs under graph operations [PDF]
14 pages, 3 figures, Journal ...
Hosam Abdo, Darko Dimitrov
openalex +5 more sources
Integrity of graph operations [PDF]
A communication network can be considered to be highly vulnerable to disruption if the failure of few members (nodes or links) can result in no members being able to communicate with very many others. These communication networks can be modeled through
B. Basavanagoud +2 more
doaj +1 more source
On fz- Domination Number of Fuzzy Graphs
Given a fuzzy graph G = (V; ; ), the fz- domination number, fz(G), is the least scalar cardinality of an fz- dominating set of G. In this article, we examine several features of fz-domination number of fuzzy graphs as a result of various fuzzy graph ...
A Lekha, K.S Parvathy
doaj +1 more source
Hyperbolicity on Graph Operators [PDF]
A graph operator is a mapping F : Γ → Γ ′ , where Γ and Γ ′ are families of graphs. The different kinds of graph operators are an important topic in Discrete Mathematics and its applications. The symmetry of this operations allows us to prove inequalities relating the hyperbolicity constants of a graph G and its graph operators ...
J. A. Méndez-Bermúdez +3 more
openaire +2 more sources
The Eccentric-Distance Sum Polynomials of Graphs by Using Graph Products
The correlations between the physico-chemical properties of a chemical structure and its molecular structure-properties are used in quantitative structure-activity and property relationship studies (QSAR/QSPR) by using graph-theoretical analysis and ...
Alaa Altassan +2 more
doaj +1 more source
KCD indices and coindices of graphs
The relationship between vertices of a graph is always an interesting fact, but the relations of vertices and edges also seeks attention. Motivation of the relationship between vertices and edges of a graph has helped to arise with a set of new degree ...
Keerthi G. Mirajkar, Akshata Morajkar
doaj +1 more source
Semi Square Stable Graphs and Efficient Dominating Sets [PDF]
A graph $G$ is called semi square stable if $\alpha (G^{2})=i(G)$ where $%\alpha (G^{2})$ is the independence number of $G^{2}$ and $i(G)$ is the independent dominating number of $G$.
Baha̓ Abughazaleh, Omar Abughneim
doaj +1 more source
Graph Algebras and Derived Graph Operations
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

