Results 51 to 60 of about 5,134,655 (243)
On the first and second Zagreb indices of some products of signed graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Some of the most comprehensively studied degree-based topological indices are the Zagreb indices. In this article, the pair of Zagreb indices have been determined for five product graphs namely tensor product, Cartesian product, lexicographic product ...
Shivani Rai, Biswajit Deb
doaj +1 more source
On the indices of certain graph products [PDF]
Transactions on CombinatoricsMolecular descriptors are numerical graph invariants that are used to study the chemical structure of molecules. In this paper, we determine the upper bound of the Sombor index based on four operations involving the subdivision graph, semi-total point ...
Ishita Sarkar, Manjunath Nanjappa
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
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
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
Some applications of Rees products of posets to equivariant gamma-positivity [PDF]
, 2019 The Rees product of partially ordered sets was introduced by Bj\"orner and Welker. Using the theory of lexicographic shellability, Linusson, Shareshian and Wachs proved formulas, of significance in the theory of gamma-positivity, for the dimension of the
Athanasiadis, Christos A.
core +3 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