Results 41 to 50 of about 2,078,525 (187)
Interval Valued Pentapartitioned Neutrosophic Graphs with an Application to MCDM
Operational Research in Engineering Sciences: Theory and Applications, 2022 The concept of interval valued pentapartitioned neutrosophic set is the extension of interval-valued neutrosophic set, quadripartitioned neutrosophic set, interval valued quadripartitioned neutrosophic set and pentapartitioned neutrosophic set.
Said Broumi +7 more
doaj +1 more source
BarekengThe rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +1 more source
Pattern vectors from algebraic graph theory [PDF]
, 2005 Graphstructures have proven computationally cumbersome for pattern analysis. The reason for this is that, before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of ...
Bin Luo +3 more
core +4 more sources
On dominating graph of graphs, median graphs and partial cubes, and graphs in which complement of every minimal dominating set is minimal dominating [PDF]
arXiv, 2022 The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating graph has become an increasingly interesting subject in domination theory.
arxiv
Acta Sci. Math. (Szeged) 86 (2020) 31-50, 2019 Introduced by C. R. Shallon in 1979, graph algebras establish a useful connection between graph theory and universal algebra. This makes it possible to investigate graph varieties and graph quasivarieties, i.e., classes of graphs described by identities or quasi-identities.
arxiv +1 more source
First-order logic axiomatization of metric graph theory [PDF]
, 2022 The main goal of this note is to provide a First-Order Logic with Betweenness (FOLB) axiomatization of the main classes of graphs occurring in Metric Graph Theory, in analogy to Tarski's axiomatization of Euclidean geometry. We provide such an axiomatization for weakly modular graphs and their principal subclasses (median and modular graphs, bridged ...
arxiv +1 more source
Limit theory for the Gilbert graph [PDF]
, 2016 For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random geometric graph,
Reitzner, Matthias +2 more
core +2 more sources
Symmetry, 2018 This book contains the successful invited submissions [1–10] to a special issue of Symmetry on the subject area of ‘graph theory’ [...]
openaire +2 more sources
Universal graphs for the topological minor relation [PDF]
arXiv, 2022 A subgraph-universal graph/a topological minor-universal graph in a class of graphs $\mathcal{G}$ is a graph in $\mathcal{G}$ which contains every graph in $\mathcal{G}$ as a subgraph/topological minor. We prove that the class $\mathcal{P}$ of all countable planar graphs does not contain a topological minor-universal graph.
arxiv
Distance antimagic labeling of circulant graphs
AIMS MathematicsA distance antimagic labeling of graph $ G = (V, E) $ of order $ n $ is a bijection $ f:V(G)\rightarrow \{1, 2, \ldots, n\} $ with the property that any two distinct vertices $ x $ and $ y $ satisfy $ \omega(x)\ne\omega(y) $, where $ \omega(x) $ denotes ...
Syafrizal Sy +4 more
doaj +1 more source