Results 101 to 110 of about 2,362 (196)
FUTURES &FORESIGHT SCIENCE, Volume 8, Issue 2, August 2026.ABSTRACT In this study, we demonstrate the effects of adopting “imaginary future generations (IFGs),” which has been proven to be effective for generating futurability in individuals, on policy choices and individual attitudes toward environmentally friendly behavior.
Keishiro Hara +2 more
wiley +1 more source
A Kind of Non-commuting Graph of Finite Groups [PDF]
Journal of Sciences, Islamic Republic of Iran, 2014 Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. We denote this graph by .
B. Tolue, A. Erfanian, A. Jafarzadeh
doaj
A SURVEY ON THE AUTOMORPHISM GROUPS OF THE COMMUTING GRAPHS AND POWER GRAPHS [PDF]
Facta Universitatis, Series: Mathematics and Informatics, 2019 Let G be a nite group. The power graph P(G) of a group G is the graphwhose vertex set is the group elements and two elements are adjacent if one is a power of the other. The commuting graph \Delta(G) of a group G, is the graph whose vertices are the group elements, two of them joined if they commute. When the vertex set is G-Z(G), this graph is denoted
openaire +2 more sources
Tourism, Well‐Being, and Sustainability: Trends, Impacts, and Perspectives
Sustainable Development, Volume 34, Issue 4, Page 5350-5363, August 2026.ABSTRACT Research on sustainable tourism, tourists, and well‐being has key implications for tourism policies, which must align with the SDGs to enhance the well‐being of visitors and local communities. This paper analyzes the evolution of scientific production through a systematic literature review over the last 25 years.
Raquel Ibar‐Alonso +2 more
wiley +1 more source
On the diameter of a super-order-commuting graph
Discrete MathematicsWe answer a question about the diameter of an order-super-commuting graph on a symmetric group by studying the number-theoretical concept of $d$-complete sequences of primes in arithmetic progression.
Janko Bracic, Bojan Kuzma
openaire +4 more sources
Confidence Intervals for Price Discovery
Oxford Bulletin of Economics and Statistics, Volume 88, Issue 4, Page 742-764, August 2026.ABSTRACT This paper discusses asymptotic and bootstrap confidence intervals for multivariate permanent‐transitory decompositions of cointegrated vector autoregressive I(1) systems, with a focus on price discovery. Alternative estimators of the permanent components are compared in terms of efficiency also under separable linear restrictions on the ...
Heino Bohn Nielsen +2 more
wiley +1 more source
Verifying commuting quantum computations via fidelity estimation of weighted graph states
New Journal of Physics, 2019 The instantaneous quantum polynomial time (IQP) model is one of promising models to demonstrate a quantum computational advantage over classical computers.
Masahito Hayashi, Yuki Takeuchi
doaj +1 more source
Women's Empowerment and Intra‐Household Bargaining Power
Review of Development Economics, Volume 30, Issue 3, Page 1643-1656, August 2026.ABSTRACT We assess the effectiveness of the Abbreviated Women's Empowerment in Agriculture Index (A‐WEAI) in predicting intra‐household bargaining power. We conducted a lab‐in‐the‐field experiment with agricultural households, where spouses made decisions about money allocations.
Marina Nacka +2 more
wiley +1 more source
Aspects of the commuting graph
Journal of AlgebraThe commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given graph is the commuting graph of a finite group; we give a quasipolynomial algorithm, and a polynomial algorithm for ...
V. Arvind +3 more
openaire +2 more sources
Characterization of the symmetric group by its non-commuting graph [PDF]
International Journal of Group Theory, 2013 The non-commuting graph $nabla(G)$ of a non-abelian group $G$ is defined as follows: its vertex set is $G-Z(G)$ and two distinct vertices $x$ and $y$ are joined by an edge if and only if the commutator of $x$ and $y$ is not the identity. In this paper we
M.R. Darafsheh, Pedram Yousefzadeh
doaj