Results 31 to 40 of about 549,593 (301)
Operations on Neutrosophic Vague Graphs [PDF]
Neutrosophic Sets and Systems, 2020 Neutrosophic graph is a mathematical tool to hold with imprecise and unspecified data. In this manuscript, the operations on neutrosophic vague graphs are introduced. Moreover, Cartesian product, lexicographic product, cross product, strong product and
S. Satham Hussain +3 more
doaj +1 more source
Hamiltonian Cycles in Strong Products of Graphs [PDF]
Canadian Mathematical Bulletin, 1979 Abstract. Let denote the graph (k times) where is the strong product of the two graphs G and H. In this paper we prove the conjecture of J. Zaks [3]: For every connected graph G with at least two vertices there exists an integer k = k(G) for which the graph is hamiltonian.
Bermond, J. C. +2 more
openaire +3 more sources
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
Various Product on Multi Fuzzy Graphs
Ratio Mathematica, 2022 In this paper, the definition of complement of multi fuzzy graph, direct sum of two multi fuzzy graphs are given and derived some theorems related to them.
R Muthuraj, K Krithika, S Revathi
doaj +1 more source
Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms [PDF]
, 2013 It is well-known that all finite connected graphs have a unique prime factor decomposition (PFD) with respect to the strong graph product which can be computed in polynomial time.
Hellmuth, Marc +2 more
core +1 more source
Bounds on the Twin-Width of Product Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Twin-width is a graph width parameter recently introduced by Bonnet, Kim, Thomass\'{e} & Watrigant. Given two graphs $G$ and $H$ and a graph product $\star$, we address the question: is the twin-width of $G\star H$ bounded by a function of the twin ...
William Pettersson, John Sylvester
doaj +1 more source
Strong geodetic problem on Cartesian products of graphs [PDF]
, 2017 The strong geodetic problem is a recent variation of the geodetic problem. For a graph $G$, its strong geodetic number ${\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that each vertex of $G$ lies on a fixed shortest path between a ...
Iršič, Vesna, Klavžar, Sandi
core +2 more sources
Strong products of Kneser graphs
Discrete Mathematics, 1994 For a (simple, undirected) graph \(G = (V(G), E(G))\), let \(\chi(G)\) and \(\omega(G)\) denote the chromatic number and the clique number, respectively. A subgraph \(H\) of \(G\) is a retract of \(G\) iff there is an edge-preserving map \(h : V(G) \to V(H)\) with \(h(x) = x\) for all \(x \in V(H)\).
Klavžar, Sandi, Milutinović, Uroš
openaire +1 more source
Fractional strong matching preclusion of some Cartesian product graphs
Journal of Physics: Conference Series, 2021 Abstract The fractional strong matching preclusion number of a graph is the minimum number of edges and vertices whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the fractional strong matching preclusion number for the Cartesian product of a graph and a cycle.
Bo Zhu, Shumin Zhang, Chenfu Ye
openaire +2 more sources
On bounds for topological descriptors of φ-sum graphs
Journal of Taibah University for Science, 2020 The properties of chemical compounds are very important for the studies of the non-isomorphism phenomenon's related to the molecular graphs. Topological indices (TIs) are one of the mathematical tools which are used to study these properties.
Yu-Ming Chu +3 more
doaj +1 more source