Results 1 to 10 of about 1,212,791 (104)

Somerset Maugham's Failings

open access: yes
Critical Quarterly, EarlyView.
Allan Hepburn
wiley   +1 more source

Verbal Metadisputes

open access: yesPhilosophy and Phenomenological Research, Volume 113, Issue 1, Page 153-168, July 2026.
ABSTRACT Many philosophical disputes have become so intractable that philosophers question whether there is a fact of the matter as to which side is right or whether these disputes are entirely verbal. Yet these “metadisputes” have also become intractable. This raises the question: Could they, too, be verbal? What would that even mean? Using tools from
Alexander W. Kocurek
wiley   +1 more source

2D Magnetic and Topological Quantum Materials and Devices for Ultralow Power Spintronics

open access: yesAdvanced Functional Materials, Volume 36, Issue 44, 1 June 2026.
2D magnets and topological quantum materials enable ultralow‐power spintronics by combining robust magnetic order with symmetry‐protected, Berry‐curvature‐driven transport. Fundamentals of 2D anisotropy and spin‐orbit‐coupling induced band inversion are linked to scalable growth and vdW stacking.
Brahmdutta Dixit   +5 more
wiley   +1 more source

Nowhere-zero modular edge-graceful graphs [PDF]

open access: yes, 2012
For a connected graph G of order n ≥ 3, let f: E(G) → ℤₙ be an edge labeling of G. The vertex labeling f': V(G) → ℤₙ induced by f is defined as $f'(u) = ∑_{v ∈ N(u)} f(uv)$, where the sum is computed in ℤₙ. If f' is one-to-one, then f is called a modular
Jones, Ryan, Zhang, Ping
core   +1 more source

Polaritonic Spectra of Optical Mie Voids

open access: yesNanophotonics, Volume 15, Issue 9, 13 May 2026.
Optical Mie voids have been shown to provide a versatile platform for polaritonic physics. Analytical and numerical analysis reveal how void resonances couple to excitonic media, enabling weak‐ and strong‐coupling regimes, polariton gaps, Q‐factor enhancement, and spatial mode localization.
Evgeny Ryabkov   +3 more
wiley   +1 more source

Edge δ− Graceful Labeling for Some Cyclic-Related Graphs

open access: yes, 2020
In this paper, we introduce a new type of labeling of a graph G with p vertices and q edges called edge δ− graceful labeling, for any positive integer δ, as a bijective mapping f of the edge set EG into the set δ,2δ,3δ,⋯,qδ such that the induced mapping ...
Mohamed R. Zeen El Deen
core   +1 more source

Free‐Air Electric Arc Phenomena in High‐Voltage Energy Transmission Systems: A Comprehensive Review Integrating Physical Modeling and Intelligent Monitoring

open access: yesEngineering Reports, Volume 8, Issue 5, May 2026.
This graphical abstract compares circuit‐based, signal‐processing‐based, and intelligent‐learning‐based approaches for secondary arc‐fault detection, highlighting their key principles and practical advantages. ABSTRACT Reliable detection of free‐air electric arc faults in high‐voltage overhead transmission lines, together with accurate discrimination ...
Mahyar Abasi   +2 more
wiley   +1 more source

Why Autonomous Vehicles Are Not Ready Yet: A Multi‐Disciplinary Review of Problems, Attempted Solutions, and Future Directions

open access: yesJournal of Field Robotics, Volume 43, Issue 3, Page 2254-2341, May 2026.
ABSTRACT Personal autonomous vehicles can sense their surrounding environment, plan their route, and drive with little or no involvement of human drivers. Despite the latest technological advancements and the hopeful announcements made by leading entrepreneurs, to date no personal vehicle is approved for road circulation in a “fully” or “semi ...
Xingshuai Dong   +13 more
wiley   +1 more source

Edge even graceful labeling of torus grid graph

open access: yes, 2020
We study the family of torus grid graphs. We also obtain necessary and sufficent conditions to be edge even graceful labeling for all of the cases of every member of this ...
Saleh, Wedad, Daoud, Salama Nagy
core   +1 more source

Odd-Graceful Total Colorings for Constructing Graphic Lattice

open access: yes, 2021
The security of passwords generated by the graphic lattices is based on the difficulty of the graph isomorphism, graceful tree conjecture, and total coloring conjecture.
Hui Sun, Bing Yao, Jing Su
core   +1 more source

Home - About - Disclaimer - Privacy