Results 31 to 40 of about 26,105 (190)
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs.
Didem Gözüpek +2 more
doaj +1 more source
The Clustering Coefficient for Graph Products
Axioms, 2023 The clustering coefficient of a vertex v, of degree at least 2, in a graph Γ is obtained using the formula C(v)=2t(v)deg(v)(deg(v)−1), where t(v) denotes the number of triangles of the graph containing v as a vertex, and the clustering coefficient of Γ ...
Jhon J. Aguilar-Alarcón +2 more
doaj +1 more source
Automorphisms of lexicographic products
Discrete Mathematics, 1975 AbstractThe automorphism group Γ(P) of a partially ordered set P consists of all permutations on P that preserve order (and have order preserving inverses). In this paper we raise, and partially answer, the question: How is the automorphism group of the lexicographic product (P × Q) of two orders (P and Q) related to the automorphism groups of the ...
Bird, Elliot +2 more
openaire +2 more sources
Lexicographic Product and Isoperimetric Number [PDF]
ISRN Combinatorics, 2013 The isoperimetric number of a graph , denoted by , was introduced by Mohar (1987). A graph and a subset of its vertices are given, and let denote the edge boundary of , the set of edges which connects vertices in to vertices not in . The isoperimetric number of is defined as .
Ersin Aslan, Alpay Kirlangic
openaire +1 more source
Algorithms for zero-dimensional ideals using linear recurrent sequences [PDF]
, 2017 Inspired by Faug\`ere and Mou's sparse FGLM algorithm, we show how using linear recurrent multi-dimensional sequences can allow one to perform operations such as the primary decomposition of an ideal, by computing the annihilator of one or several such ...
A Bostan +14 more
core +4 more sources
On matching extendability of lexicographic products
RAIRO - Operations Research, 2017 Summary: A graph \(G\) of even order is \(\ell\)-extendable if it is of order at least \(2\ell+2\), contains a matching of size \(\ell\), and if every such matching is contained in a perfect matching of \(G\). In this paper, we study the extendability of lexicographic products of graphs.
Chiarelli, Nina +4 more
openaire +3 more sources
Identifying Codes of Lexicographic Product of Graphs [PDF]
The Electronic Journal of Combinatorics, 2012 Let $G$ be a connected graph and $H$ be an arbitrary graph. In this paper, we study the identifying codes of the lexicographic product $G[H]$ of $G$ and $H$. We first introduce two parameters of $H$, which are closely related to identifying codes of $H$. Then we provide the sufficient and necessary condition for $G[H]$ to be identifiable.
Feng, Min, Xu, Min, Wang, Kaishun
openaire +3 more sources
Representable Lexicographic Products
Order, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Infinite Lexicographic Products of Triangular Algebras [PDF]
Bulletin of the London Mathematical Society, 1995 Some new connections are given between linear orderings and triangular operator algebras. A lexicograhic product is defined for triangular operator algebras and the Jacobson radical of an infinite lexicographic product of upper triangular matrix algebras is determined.
openaire +3 more sources
Lexicographic Orders of Intuitionistic Fuzzy Values and Their Relationships
Mathematics, 2019 Intuitionistic fuzzy multiple attribute decision making deals with the issue of ranking alternatives based on the decision information quantified in terms of intuitionistic fuzzy values. Lexicographic orders can serve as efficient and indispensable tools
Feng Feng +4 more
doaj +1 more source