Results 11 to 20 of about 4,376,990 (279)
Strong resolving partitions for strong product graphs and Cartesian product graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 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
Radio Labeling for Strong Product K3 ⊠ Pn
IEEE Access, 2020 Many variations of graph labeling has been defined in the literature. e.g., graceful, harmonious and radio labeling etc. In information technology and in data sciences, we need secrecy of data, different channel assignment and accuracy of transmission of
Hengxiao Qi +4 more
doaj +1 more source
Fork-decomposition of strong product of graphs
Ratio Mathematica, 2023 Decomposition of arbitrary graphs into subgraphs of small size is assuming importance in the literature. There are several studies on the isomorphic decomposition of graphs into paths, cycles, trees, stars, sunlet etc.
Samuel Issacraj, Paulraj Joseph
doaj +1 more source
Cosmological particle production at strong coupling [PDF]
Journal of High Energy Physics, 2015 We study the dynamics of a strongly-coupled quantum field theory in a cosmological spacetime using the holographic AdS/CFT correspondence. Specifically we consider a confining gauge theory in an expanding FRW universe and track the evolution of the stress-energy tensor during a period of expansion, varying the initial temperature as well as the rate ...
Rangamani, Mukund +2 more
openaire +5 more sources
F index of graphs based on four new operations related to the strong product
AKCE International Journal of Graphs and Combinatorics, 2020 For a molecular graph, the first Zagreb index of a graph is equal to the sum of squares of the vertex degrees of the graph and the forgotten topological index (F-index) of a graph is defined as the sum of cubes of the vertex degrees of the graph.
D. Sarala +3 more
doaj +1 more source
A study on vague-valued hesitant fuzzy graph with application
Frontiers in Physics, 2022 The hesitant fuzzy graph (HFG) is one of the most powerful tools to find the strongest influential person in a network. Many problems of practical interest can be modeled and solved by using HFG algorithms.
Yongsheng Rao +4 more
doaj +1 more source
A strong direct product theorem for quantum query complexity [PDF]
, 2011 We show that quantum query complexity satisfies a strong direct product theorem. This means that computing $k$ copies of a function with less than $k$ times the quantum queries needed to compute one copy of the function implies that the overall success ...
Ambainis Andris +13 more
core +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
On strong product measurability [PDF]
Real Analysis Exchange, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources