Results 21 to 30 of about 96 (83)
Graph Exponentiation and Neighborhood Reconstruction
Discussiones Mathematicae Graph Theory, 2021 Any graph G admits a neighborhood multiset 𝒩(G) = {NG(x) | x ∈ V (G)} whose elements are precisely the open neighborhoods of G. We say G is neighborhood reconstructible if it can be reconstructed from 𝒩(G), that is, if G ≅ H whenever 𝒩 (G) = 𝒩(H) for ...
Hammack Richard H.
doaj +1 more source
On the Connectivity of Token Graphs of Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Let $k$ and $n$ be integers such that $1\leq k \leq n-1$, and let $G$ be a simple graph of order $n$. The $k$-token graph $F_k(G)$ of $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever ...
Ruy Fabila-Monroy +2 more
doaj +1 more source
The General Position Problem on Kneser Graphs and on Some Graph Operations
Discussiones Mathematicae Graph Theory, 2021 A vertex subset S of a graph G is a general position set of G if no vertex of S lies on a geodesic between two other vertices of S. The cardinality of a largest general position set of G is the general position number (gp-number) gp(G) of G.
Ghorbani Modjtaba +5 more
doaj +1 more source
Structures of W(2.2) Lie conformal algebra
Open Mathematics, 2016 The purpose of this paper is to study W(2, 2) Lie conformal algebra, which has a free ℂ[∂]-basis {L, M} such that [LλL]=(∂+2λ)L,[LλM]=(∂+2λ)M,[MλM]=0$\begin{equation}[{L_\lambda }L] = (\partial + 2\lambda )L,[{L_\lambda }M] = (\partial + 2\lambda )M,[{M_\
Yuan Lamei, Wu Henan
doaj +1 more source
Maximum nullity and zero forcing of circulant graphs
Special Matrices, 2020 The zero forcing number of a graph has been applied to communication complexity, electrical power grid monitoring, and some inverse eigenvalue problems.
Duong Linh +4 more
doaj +1 more source
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
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