Results 41 to 50 of about 5,793,190 (230)
The Sigma Coindex of Graph Operations
Journal of Mathematics, 2021 The sigma coindex is defined as the sum of the squares of the differences between the degrees of all nonadjacent vertex pairs. In this paper, we propose some mathematical properties of the sigma coindex.
Yasar Nacaroglu
doaj +1 more source
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
First-Fit coloring of Cartesian product graphs and its defining sets [PDF]
, 2016 Let the vertices of a Cartesian product graph $G\Box H$ be ordered by an ordering $\sigma$. By the First-Fit coloring of $(G\Box H, \sigma)$ we mean the vertex coloring procedure which scans the vertices according to the ordering $\sigma$ and for each ...
Zaker, Manouchehr
core +3 more sources
Computing the Rank Profile Matrix [PDF]
, 2015 The row (resp. column) rank profile of a matrix describes the staircase shape of its row (resp. column) echelon form. In an ISSAC'13 paper, we proposed a recursive Gaussian elimination that can compute simultaneously the row and column rank profiles of a
Bourbaki N. +4 more
core +5 more sources
Symmetry, 2021 Let G be a graph with no isolated vertex and let N(v) be the open neighbourhood of v∈V(G). Let f:V(G)→{0,1,2} be a function and Vi={v∈V(G):f(v)=i} for every i∈{0,1,2}.
A. Almerich-Chulia +3 more
semanticscholar +1 more source
Characterization of the hyperbolicity in the lexicographic product
Electronic Notes in Discrete Mathematics, 2014 Abstract If X is a geodesic metric space and x 1 , x 2 , x 3 ∈ X , a geodesic triangle T = { x 1 , x 2 , x 3 } is the union of the three geodesics [ x 1 x 2 ] , [ x 2 x 3 ] and [ x 3 x 1 ] in X.
Walter Carballosa +2 more
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
Hamiltonian decomposition of lexicographic product
Journal of Combinatorial Theory, Series B, 1981 AbstractIn this paper we prove the conjecture of J.-C. Bermond (Ann. Discrete Math. 36 (1978), 21–28): If two graphs are decomposable into Hamiltonian cycles, then their lexicographic product is decomposable, too.
Zsolt Baranyai, Gy. R. Szász
openaire +2 more sources
Representable Lexicographic Products
Order, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources