Results 11 to 20 of about 2,243,492 (285)
Bondage and non-bondage sets in regular intuitionistic fuzzy graphs [PDF]
Notes on IFS, 2023 The concept of strong edges in domination set and its properties are discussed. The increasing or reducing domination numbers using cardinality are also studied.
R. Buvaneswari, K. Umamaheswari
doaj +1 more source
Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning [PDF]
Neutrosophic Sets and Systems, 2020 In this paper, we first define the Neutrosophic tree using the concept of the strong cycle. We then define a strong spanning Neutrosophic tree. In the following, we propose an algorithm for detecting the maximum spanning tree in Neutrosophic graphs. Next,
Masoud Ghods, Zahra Rostami
doaj +1 more source
Ratio Mathematica, 2023 Let G=(V,\ E) be a simple graph. A subset S of E(G) is a strong (weak) efficient edge dominating set of G if │Ns[e] S│ = 1 for all e E(G)(│Nw[e] S│ = 1 for all e E(G)) where Ns(e) ={f / f E(G), f is adjacent to e & deg f ≥ deg e}(Nw(e) ={f / f
M Annapoopathi, N Meena
doaj +1 more source
From Edge-Coloring to Strong Edge-Coloring [PDF]
The Electronic Journal of Combinatorics, 2015 In this paper we study a generalization of both proper edge-coloring and strong edge-coloring: $k$-intersection edge-coloring, introduced by Muthu, Narayanan and Subramanian. In this coloring, the set $S(v)$ of colors used by edges incident to a vertex $v$ does not intersect $S(u)$ on more than $k$ colors when $u$ and $v$ are adjacent.
Borozan, Valentin +6 more
openaire +3 more sources
Tunneling edges at strong disorder [PDF]
Physical Review B, 1995 RevTeX, 4 ...
Miller, Jonathan, Rojo, A. G.
openaire +3 more sources
Strong Edge Geodetic Problem on Grids [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2021 Let $G=(V(G),E(G))$ be a simple graph. A set $S \subseteq V(G)$ is a strong edge geodetic set if there exists an assignment of exactly one shortest path between each pair of vertices from $S$, such that these shortest paths cover all the edges $E(G)$. The cardinality of a smallest strong edge geodetic set is the strong edge geodetic number $\text{sge ...
openaire +3 more sources
Strong Edge Coloring of K4(t)-Minor Free Graphs
Axioms, 2023 A strong edge coloring of a graph G is a proper coloring of edges in G such that any two edges of distance at most 2 are colored with distinct colors. The strong chromatic index χs′(G) is the smallest integer l such that G admits a strong edge coloring ...
Huixin Yin, Miaomiao Han, Murong Xu
doaj +1 more source
New Concepts of Vertex Covering in Cubic Graphs with Its Applications
Mathematics, 2022 Graphs serve as one of the main tools for the mathematical modeling of various human problems. Fuzzy graphs have the ability to solve uncertain and ambiguous problems.
Huiqin Jiang +4 more
doaj +1 more source
Strong Chromatic Index of Outerplanar Graphs
Axioms, 2022 The strong chromatic index χs′(G) of a graph G is the minimum number of colors needed in a proper edge-coloring so that every color class induces a matching in G. It was proved In 2013, that every outerplanar graph G with Δ≥3 has χs′(G)≤3Δ−3.
Ying Wang +3 more
doaj +1 more source
Statistical localization: From strong fragmentation to strong edge modes
Physical Review B, 2020 Certain disorder-free Hamiltonians can be non-ergodic due to a \emph{strong fragmentation} of the Hilbert space into disconnected sectors. Here, we characterize such systems by introducing the notion of `statistically localized integrals of motion' (SLIOM), whose eigenvalues label the connected components of the Hilbert space.
Rakovszky, Tibor +4 more
openaire +4 more sources