Results 21 to 30 of about 100,234 (286)

Solving String Problems on Graphs Using the Labeled Direct Product [PDF]

open access: yes, 2022
Suffix trees are an important data structure at the core of optimal solutions to many fundamental string problems, such as exact pattern matching, longest common substring, matching statistics, and longest repeated substring.
Rizzo, Nicola   +2 more
core   +1 more source

Graph Fourier transforms on directed product graphs

open access: yesCoRR, 2022
Graph Fourier transform (GFT) is one of the fundamental tools in graph signal processing to decompose graph signals into different frequency components and to represent graph signals with strong correlation by different modes of variation effectively. The GFT on undirected graphs has been well studied and several approaches have been proposed to define
Cheng Cheng 0003   +3 more
openaire   +2 more sources

Total connected domination game [PDF]

open access: yesOpuscula Mathematica, 2021
The (total) connected domination game on a graph \(G\) is played by two players, Dominator and Staller, according to the standard (total) domination game with the additional requirement that at each stage of the game the selected vertices induce a ...
Csilla Bujtás   +3 more
doaj   +1 more source

On Well-Covered Direct Products

open access: yesDiscussiones Mathematicae Graph Theory, 2022
A graph G is well-covered if all maximal independent sets of G have the same cardinality. In 1992 Topp and Volkmann investigated the structure of well-covered graphs that have nontrivial factorizations with respect to some of the standard graph products.
Kuenzel Kirsti, Rall Douglas F.
doaj   +1 more source

A Novel Study of Graphs Based on m-Polar Cubic Structures

open access: yesJournal of Function Spaces, 2022
By combining the notions of interval-valued m-polar fuzzy graphs and m-polar fuzzy graphs, the notion of m-polar cubic graphs is first introduced. Then, the degree of a vertex in m-polar cubic graphs and complete m-polar cubic graphs is defined.
G. Muhiuddin   +4 more
doaj   +1 more source

Domination Parameters of the Unitary Cayley Graph of 𝕑/n𝕑

open access: yesDiscussiones 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

Directed Random Dot Product Graphs [PDF]

open access: yesInternet Mathematics, 2008
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to clustering, the small world property, and degree distribution. These models are motivated by the random dot product graphs developed by Kraetzl, Nickel, and Scheinerman.
Stephen J. Young, Edward R. Scheinerman
openaire   +2 more sources

Complex Hesitant Fuzzy Graph

open access: yesFuzzy Information and Engineering, 2023
Government policymakers face a problem about illustrating and evaluating strategies and plan to design active communities which need to be assessed for studying the collaboration between ministries.
Eman A. AbuHijleh
doaj   +1 more source

Construction of Mutually Orthogonal Graph Squares Using Novel Product Techniques

open access: yesJournal of Mathematics, 2022
Sets of mutually orthogonal Latin squares prescribe the order in which to apply different treatments in designing an experiment to permit effective statistical analysis of results, they encode the incidence structure of finite geometries, they ...
A. El-Mesady, Omar Bazighifan
doaj   +1 more source

Outer Independent Double Italian Domination of Some Graph Products

open access: yesTheory and Applications of Graphs, 2023
An outer independent double Italian dominating function on a graph $G$ is a function $f:V(G)\rightarrow\{0,1,2,3\}$ for which each vertex $x\in V(G)$ with $\color{red}{f(x)\in \{0,1\}}$ then $\sum_{y\in N[x]}f(y)\geqslant 3$ and vertices assigned $0 ...
Rouhollah Jalaei, Doost Ali Mojdeh
doaj   +1 more source

Home - About - Disclaimer - Privacy