Results 41 to 50 of about 5,134,655 (243)
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
On 2-Resolving Dominating Sets in the Join, Corona and Lexicographic Product of Two Graphs
European Journal of Pure and Applied Mathematics, 2022 Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions.
Jean Mansanadez Cabaro, Helen M. Rara
semanticscholar +1 more source
Restrained 2-Resolving Sets in the Join, Corona and Lexicographic Product of Two Graphs
European Journal of Pure and Applied Mathematics, 2022 Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions.
Jean Mansanadez Cabaro, Helen M. Rara
semanticscholar +1 more source
Graph Invariants of Deleted Lexicographic Product of Graphs [PDF]
Mathematics Interdisciplinary Research, 2019 The deleted lexicographic product G[H]-nG of graphs G and H is a graph with vertex set V(G)×V(H) and u=(u1, v1) is adjacent with v=(u2, v2) whenever (u1=u2 and v1 is adjacent with v2) or (v1 ≠ v2 and u1 is adjacent with u2).
Bahare Akhavan Mahdavi +2 more
doaj +1 more source
Rees products and lexicographic shellability [PDF]
Journal of Combinatorics, 2012 31 pages; 1 figure; part of this paper was originally part of the longer paper arXiv:0805.2416v1, which has been split into three ...
Linusson, Svante +2 more
openaire +2 more sources
Restrained 2-Resolving Dominating Sets in the Join, Corona and Lexicographic Product of Two Graphs
European Journal of Pure and Applied Mathematics, 2022 Let G be a connected graph. An ordered set of vertices {v1, ..., vl} is a 2-resolving set for G if, for any distinct vertices u, w ∈ V (G), the lists of distances (dG(u, v1), ..., dG(u, vl)) and (dG(w, v1), ..., dG(w, vl)) differ in at least 2 positions.
Jean Mansanadez Cabaro, Helen M. Rara
semanticscholar +1 more source
On 2-Resolving Hop Dominating Sets in the Join, Corona and Lexicographic Product of Graphs
European Journal of Pure and Applied Mathematics, 2022 Let G be a connected graph. A set S of vertices in G is a 2-resolving hop dominating set of G if S is a 2-resolving set in G and for every vertex x ∈ V (G)\S there exists y ∈ S such that dG(x, y) = 2.
A. M. Mahistrado, Helen M. Rara
semanticscholar +1 more source
Closed formulas for the total Roman domination number of lexicographic product graphs
Ars Math. Contemp., 2021 Let G be a graph with no isolated vertex and f : V ( G ) → {0, 1, 2} a function. Let V i = { x ∈ V ( G ) : f ( x ) = i } for every i ∈ {0, 1, 2} . We say that f is a total Roman dominating function on G if every vertex in V 0 is adjacent to at least
Abel Cabrera Martínez +1 more
semanticscholar +1 more source
Total Coloring Conjecture for Certain Classes of Graphs
Algorithms, 2018 A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color.
R. Vignesh, J. Geetha, K. Somasundaram
doaj +1 more source
The Sigma Coindex of Graph Operations
Journal of Mathematics, 2021 The sigma coindex is defined as the sum of the squares of the differences between the degrees of all nonadjacent vertex pairs. In this paper, we propose some mathematical properties of the sigma coindex.
Yasar Nacaroglu
doaj +1 more source