Results 41 to 50 of about 157 (114)
Soft covering based rough graphs and corresponding decision making
Open Mathematics, 2019 Soft set theory and rough set theory are two new tools to discuss uncertainty. Graph theory is a nice way to depict certain information. Particularly soft graphs serve the purpose beautifully.
Park Choonkil +5 more
doaj +1 more source
Domination Parameters of the Unitary Cayley Graph of š/nš
Discussiones Mathematicae Graph Theory, 2023 The unitary Cayley graph of š/nš, denoted Xn, is the graph with vertex set {0, . . ., n ā 1} where vertices a and b are adjacent if and only if gcd(a ā b, n) = 1.
Burcroff Amanda
doaj +1 more source
Generalized 4-connectivity of hierarchical star networks
Open Mathematics, 2022 The connectivity is an important measurement for the fault-tolerance of a network. The generalized connectivity is a natural generalization of the classical connectivity. An SS-tree of a connected graph GG is a tree T=(Vā²,Eā²)T=\left(V^{\prime} ,E^{\prime}
Wang Junzhen, Zou Jinyu, Zhang Shumin
doaj +1 more source
The Cordial Labeling for the Four-Leaved Rose Graph
, 2018 A cactus graph with four blocks which are all cycles, not necessarily be of the same size, is called four-leaved rose graph and denoted by Ln, m, k, s, where n, m, k and s represent she sizes of the four cycles.
A. Elrokh
semanticscholar +1 more source
Weak Total Resolvability In Graphs
Discussiones Mathematicae Graph Theory, 2016 A vertex v ā V (G) is said to distinguish two vertices x, y ā V (G) of a graph G if the distance from v to x is di erent from the distance from v to y.
Casel Katrin +3 more
doaj +1 more source
Integral Laplacian graphs with a unique repeated Laplacian eigenvalue, I
Special Matrices, 2023 The set Si,n={0,1,2,ā¦,nā1,n}\{i}{S}_{i,n}=\left\{0,1,2,\ldots ,n-1,n\right\}\setminus \left\{i\right\}, 1ā©½iā©½n1\leqslant i\leqslant n, is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is Si,n{S}_{i,n}. The
Hameed Abdul, Tyaglov Mikhail
doaj +1 more source
SIMPLE GRAPHOIDAL COVERING NUMBER OF PRODUCT OF GRAPHS
, 2016 A graphoidal cover of G is a set Ļ of (not necessarily open) paths in G, such that every path in Ļ has at least two vertices, every vertex of G is an internal vertex of at most one path in Ļ and every edge of G is in exactly one path in Ļ.
G. V. Narayanan, J. Suseela, R. Kala
semanticscholar +1 more source
Construction of Graphs and ZeroāDivisor Graphs by DegreeāJoint Operations of Graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.The new construction of graphs obtained by degreeājoint operations between maximumādegree and minimumādegree of some types of graphs with different vertex and edge sets denoted by GĪ“, GĪ respectively, joins vertices of maximum (minimum) degree in one graph with those of the same type in the other graph of the second graph, where the degreeājoint ...
Mohammed N. Authman +3 more
wiley +1 more source
On Grundy Total Domination Number in Product Graphs
Discussiones Mathematicae Graph Theory, 2021 A longest sequence (v1, . . ., vk) of vertices of a graph G is a Grundy total dominating sequence of G if for all i, N(Ļ j)\āŖj=1i-1N(Ļ j)ā ā N({\upsilon _j})\backslash \bigcup\nolimits_{j = 1}^{i - 1} {N({\upsilon _j})} \ne \emptyset .
BreŔar BoŔtjan +8 more
doaj +1 more source
Gracefulness of graphs obtained from vertex duplication
, 2016 A graceful labeling of a graph G with n edges is an injection f : V (G) ā {0, 1, 2, . . . , n} with the property that the resulting edge labels are distinct where an edge incident with vertices u and v is assigned the label |f(u) ā f(v)|.
G. Sethuraman +2 more
semanticscholar +1 more source