Results 41 to 50 of about 5,146,733 (247)
On primality of Cartesian product of graphs [PDF]
Arab Journal of Mathematical SciencesPurposeThe present work focuses on the primality and the Cartesian product of graphs.Design/methodology/approachGiven a graph G, a subset M of V (G) is a module of G if, for a, b ∈ M and x ∈ V (G) \ M, xa ∈ E(G) if and only if xb ∈ E(G).
Nadia El Amri +2 more
doaj +1 more source
Betweenness centrality in Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Betweenness centrality is a widely used measure in various graphs and it has a pivotal role in the analysis of complex networks. It measures the potential or power of a node to control the communication over the network.
Sunil Kumar R., Kannan Balakrishnan
doaj +1 more source
On Intuitionistic Fuzzy PMS-Ideals of a PMS-Algebra Under Homomorphism and Cartesian Product
International Journal of Computational Intelligence Systems, 2023 In this paper, we use the concept of an intuitionistic fuzzy set to PMS-ideals in PMS-algebras. We discuss the notion of intuitionistic fuzzy PMS-ideals under homomorphism and Cartesian product and investigate several related properties. The homomorphism
Berhanu Assaye Alaba +2 more
doaj +1 more source
Geodesic bipancyclicity of the Cartesian product of graphs
Theory and Applications of Graphs, 2022 A cycle containing a shortest path between two vertices $u$ and $v$ in a graph $G$ is called a $(u,v)$-geodesic cycle. A connected graph $G$ is geodesic 2-bipancyclic, if every pair of vertices $u,v$ of it is contained in a $(u,v)$-geodesic cycle of ...
Amruta Shinde, Y.M. Borse
doaj +1 more source
Cartesian symmetry classes associated with certain subgroups of $S_m$ [PDF]
International Journal of Group TheoryIn this paper, the problem existing $O$-basis for Cartesian symmetry classes is discussed. The dimensions of Cartesian symmetry classes associated with a cyclic subgroup of the symmetric group $S_m$ (generated by a product of disjoint cycles) and the ...
Seyyed Sadegh Gholami, Yousef Zamani
doaj +1 more source
Total irregularity strength for product of two paths
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper we define a totally irregular total labeling for Cartesian and strong product of two paths, which is at the same time vertex irregular total labeling and also edge irregular total labeling.
Muhammad Kamran Siddiqui +2 more
doaj +1 more source
GRACEFUL CHROMATIC NUMBER OF SOME CARTESIAN PRODUCT GRAPHS
Ural Mathematical Journal, 2023 A graph \(G(V,E)\) is a system consisting of a finite non empty set of vertices \(V(G)\) and a set of edges \(E(G)\). A (proper) vertex colouring of \(G\) is a function \(f:V(G)\rightarrow \{1,2,\ldots,k\},\) for some positive integer \(k\) such that ...
I Nengah Suparta +3 more
doaj +1 more source
Adaptive Learning in Cartesian Product of Reproducing Kernel Hilbert Spaces [PDF]
IEEE Transactions on Signal Processing, 2014 We propose a novel adaptive learning algorithm based on iterative orthogonal projections in the Cartesian product of multiple reproducing kernel Hilbert spaces (RKHSs).
M. Yukawa
semanticscholar +1 more source
Problems of Cartesian Product Solved by Elementary School Students Sandra Maria Pinto MaginaI
Educação & Realidade, 2018 The study investigated the solution of direct (which requires multiplication for its resolution) and inverse (which requires division for its resolution) Cartesian product problems by elementary education students, examining the level of problem ...
Sandra Maria Pinto Magina +2 more
doaj +1 more source
An improvement in the two-packing bound related to Vizing's conjecture
Theory and Applications of Graphs, 2020 Vizing's conjecture states that the domination number of the Cartesian product of graphs is at least the product of the domination numbers of the two factor graphs.
Kimber Wolff
doaj +1 more source