Search
Search Results
-
-
Graph Comparison Meets Alexandrov
Graph comparison is a certain type of condition on the metric space encoded by a finite graph. We show that each nontrivial graph comparison implies...
-
Inequalities for interval-valued Riemann diamond-alpha integrals
We propose the concept of Riemann diamond-alpha integrals for time scales interval-valued functions. We first give the definition and some properties...
-
Some homological properties of edge rings of diamond snake graphs
In this paper, we study some homological properties of edge rings of a class of bipartite graphs, known as diamond snake graphs. We obtain...
-
Ramsey Numbers and Graph Parameters
According to Ramsey’s Theorem, for any natural p and q there is a minimum number R ( p , q ) such that every graph with at least R ( p , q ) vertices has...
-
Graph isomorphism: physical resources, optimization models, and algebraic characterizations
In the ( G , H )-isomorphism game, a verifier interacts with two non-communicating players (called provers), by privately sending each of them a random...
-
-
A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph
A bisection of a graph G is a partition of its vertex set into two parts of the same cardinality. A k -bisection of G is a bisection of G such that...
-
On a Countable Family of Boundary Graph Classes for the Dominating Set Problem
AbstractA hereditary class is a set of simple graphs closed under deletion of vertices; every such class is defined by the set of its minimal...
-
Inverse problem for a differential operator on a star-shaped graph with nonlocal matching condition
In this paper, we develop two approaches to investigation of inverse spectral problems for a new class of nonlocal operators on metric graphs. The...
-
On simple-minded systems over domestic Brauer graph algebras
Let A be a domestic Brauer graph algebra over an algebraically closed field. We present a practical criterion for an orthogonal system in the stable...
-
-
On the Semitotal Forcing Number of a Graph
Zero forcing is an iterative graph coloring process that starts with a subset S of “colored" vertices, all other vertices being “uncolored". At each...
-
Graph, clique and facet of boolean logical polytope
Logical analysis of data (LAD) discovers useful knowledge from a set of data in the form of a Boolean pattern for classifying future data. Generating...
-
Settling the Nonorientable Genus of the Nearly Complete Bipartite Graphs
A graph is said to be nearly complete bipartite if it can be obtained by deleting a set of independent edges from a complete bipartite graph. The...
-
Independent Domination Number of Cyclic and Acyclic Graphs
Let G = (V, E) be a graph with vertex set V and edge set E. A subset S ⊆ V is an independent dominating set if every vertex in S has its neighbour in...
-
-
An Application of Neutrosophic Graph in Decision-Making Problem for Alliances of Companies
The neutrosophic graph is an extension of the intuitionistic fuzzy graph. A neutrosophic graph is a necessary tool for handling real-life problems,...
-
-
