Results 71 to 80 of about 2,044 (191)

How Aligned Are Citizen Preferences With the 15‐Minute Cities Paradigm? An International Survey and K‐Means Clustering Study

open access: yesSustainable Development, EarlyView.
ABSTRACT This study investigates how citizens' mobility preferences align with the principles of the 15‐Minute City (15mC), addressing three research questions: what access times and transport modes citizens consider acceptable, whether mobility preference can be clustered, and which services are perceived incompatible with the 15mC.
Maria Perales‐Eguiluz   +3 more
wiley   +1 more source

On adjacency and (signless) Laplacian spectra of centralizer and co-centralizer graphs of some finite non-abelian groups

open access: yesElectronic Journal of Graph Theory and Applications
Let G be a finite non-abelian group. The centralizer graph of G is a simple undirected graph Γcent(G), whose vertices are the proper centralizers of G and two vertices are adjacent if and only if their cardinalities are identical.
Jharna Kalita, Somnath Paul
doaj   +1 more source

A note on integral non-commuting graphs

open access: yesFilomat, 2017
The non-commuting graph ?(G) of group G is a graph with the vertex set G - Z(G) and two distinct vertices x and y are adjacent whenever xy ? yx. The aim of this paper is to study integral regular non-commuting graphs of valency at most 16.
Ghorbani, Modjtaba   +1 more
openaire   +3 more sources

Local labor market frictions and platform‐based entrepreneurship

open access: yesStrategic Entrepreneurship Journal, EarlyView.
Abstract Research Summary Building on prior research about the heterogeneous impact of labor shocks on individuals' propensity to start businesses, we explore how local labor market frictions affect individuals' selection into platform‐based entrepreneurship.
Ruiqing Cao, Yifan Lyu
wiley   +1 more source

Quantum Circuit Optimization by Graph Coloring [PDF]

open access: yesQuantum
This work shows that minimizing the depth of a quantum circuit composed of commuting operations reduces to a vertex coloring problem on an appropriately constructed graph, where gates correspond to vertices and edges encode non-parallelizability.
Hochang Lee   +2 more
doaj   +1 more source

ON THE SZEGED INDEX AND ITS NON-COMMUTING GRAPH

open access: yesJurnal Teknologi, 2023
In chemistry, the molecular structure can be represented as a graph. Based on the information from the graph, its characterization can be determined by computing the topological index. Topological index is a numerical value that can be computed by using some algorithms and properties of the graph. Meanwhile, the non-commuting graph is a graph, in which
Nur Idayu Alimon   +2 more
openaire   +2 more sources

Structural change in the US office market after 2019: Evidence from lease‐level data

open access: yesReal Estate Economics, EarlyView.
Abstract This article examines how the leasing activities, contract features, and pricing of the Class A office leasing market have evolved since 2019 across five major US markets: Los Angeles, the Bay Area, Dallas, Washington, DC, and New York City. Using a granular dataset of 73,508 office leases from 2010 to 2024, we find a broad‐based contraction ...
Liang Peng, Xue Xiao
wiley   +1 more source

Graph neural networks and non-commuting operators

open access: yesAdvances in Neural Information Processing Systems 37
NeurIPS ...
Mauricio Velasco   +3 more
openaire   +3 more sources

Globalization, internal migration, and public goods provision in emerging economies

open access: yesAmerican Journal of Political Science, EarlyView.
Abstract Globalization can introduce new employment opportunities to emerging economies in multinational corporations and exporting firms. Who is best positioned to benefit, and what are the political consequences for “left behind” areas? We argue that primarily advantaged groups seize these opportunities through internal migration toward centers of ...
Benjamin Helms, Junghyun Lim
wiley   +1 more source

A Kind of Non-commuting Graph of Finite Groups [PDF]

open access: yesJournal 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  

Home - About - Disclaimer - Privacy