Results 11 to 20 of about 741,389 (216)
On total directed graphs of non-commutative rings
AKCE International Journal of Graphs and Combinatorics, 2017 For a non-commutative ring , the left total directed graph of is a directed graph with vertex set as and for the vertices and , is adjacent to if and only if there is a non-zero which is different from and , such that is a left zero-divisor of .
Kukil Kalpa Rajkhowa, Helen K. Saikia
doaj +1 more source
On the genus of some total graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a commutative ring with a proper ideal . A generalization of total graph is introduced and investigated. It is the (undirected) graph with all elements of as vertices, that two distinct vertices are adjacent if and only if where for some and is a ...
L. Hamidian Jahromi, A. Abbasi
doaj +1 more source
Karpatsʹkì Matematičnì Publìkacìï, 2019 For a (molecular) graph, the Wiener index, hyper-Wiener index and degree distance index are defined as $$W(G)= \sum_{\{u,v\}\subseteq V(G)}d_G(u,v),$$ $$WW(G)=W(G)+\sum_{\{u,v\}\subseteq V(G)} d_{G}(u,v)^2,$$ and $$DD(G)=\sum_{\{u,v\}\subseteq V(G)}d_G(u,
N. Dehgardi +2 more
doaj +1 more source
F index of graphs based on four new operations related to the strong product
AKCE International Journal of Graphs and Combinatorics, 2020 For a molecular graph, the first Zagreb index of a graph is equal to the sum of squares of the vertex degrees of the graph and the forgotten topological index (F-index) of a graph is defined as the sum of cubes of the vertex degrees of the graph.
D. Sarala +3 more
doaj +1 more source
Complete bipartite graph is a totally irregular total graph
Electronic Journal of Graph Theory and Applications, 2021 A graph G is called a totally irregular total k-graph if it has a totally irregular total k-labeling λ : V ∪ E→ 1, 2, ... , k, that is a total labeling such that for any pair of different vertices x and y of G, their weights wt(x) and wt(y) are distinct,
Meilin I. Tilukay +4 more
doaj +1 more source
Journal of Algebraic SystemsLet N be a right near-ring. Let Z(N) be the set of right zero-divisors of N.We dene total near-ring graph of N as a graph whose vertex set is the set of allelements of the near-ring N and any two distinct vertices n1; n2 2 N are adjacentif and only if n1
Moytri Sarmah
doaj +1 more source
Total Domination on Some Graph Operators
Mathematics, 2021 Let G=(V,E) be a graph; a set D⊆V is a total dominating set if every vertex v∈V has, at least, one neighbor in D. The total domination number γt(G) is the minimum cardinality among all total dominating sets.
José M. Sigarreta
doaj +1 more source
A study of the total graph in genetic code algebra [PDF]
Network Biology, 2022 Suppose R be a commutative ring and Z(R) its set of zero-divisors. Total graph is the (undirected) graph where set of all elements of R is taken as the vertex set and two vertices say x and y (x not equals to y) in R are adjacent if and only if their sum
Birinchi Kumar Boruah, Tazid Ali
doaj
The total irregularity of a graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Hosam Abdo, Stephan Brandt, D. Dimitrov
doaj +1 more source
New results of partially total fuzzy graph
BMC Research Notes, 2023 Objective The study of total fuzzy graphs in all cases is crucial for the development of both theories and applications of the graph theory. Without theory the application will not be developed.
Fekadu Tesgera Agama +2 more
doaj +1 more source