Results 121 to 130 of about 15,555,412 (284)
Temperature‐Tunable Cholesteric Liquid Crystal Optical Combiners for Extended Reality Applications
Advanced Intelligent Systems, Volume 7, Issue 3, March 2025.Recent advancements in extended reality highlight their potential to enhance traditional displays like liquid crystal displays and organic light‐emitting diode screens. This article introduces an innovative cholesteric liquid crystal‐based optical combiner for head‐mounted displays, enabling seamless transitions between augmented reality, virtual ...
Yuanjie Xia +6 more
wiley +1 more source
The Local Chromatic Number [PDF]
, 2013 The local chromatic number ψ(G) of a graph G is a graph colouring parameter that is defined as ψ(G) = min c max v∈V (G) |c(Γ̄(v))| where the minimum is taken over all proper colourings c of G and Γ̄(v) denotes the closed neighbourhood of a vertex v.
Osang, Georg Fritz, Georg Osang
core
An improvement of Hind's upper bound on the total chromatic number.
, 1996 We show that the total chromatic number of a simple k-chromatic graph exceeds the chromatic index by at most 18k ⅓ log ½ ...
Haggkvist, Roland A. +1 more
core +4 more sources
General Vertex-Distinguishing Total Colorings of Complete Bipartite Graphs
MathematicsLet G be a simple graph. A general total coloring f of G refers to a coloring of the vertices and edges of G. Let C(x) be the set of colors of vertex x and edges incident with x under f. For a general total coloring f of G in which k colors are available,
Xiang’en Chen, Ting Li
doaj +1 more source
Advanced Intelligent Systems, EarlyView.A schema‐first alignment framework builds compact, executable domain‐specific language models under data scarcity. Large‐scale synthetic question‐answer generation instills domain knowledge, and a code‐centric IR‐to‐DPO pipeline aligns generation with tool‐executable syntax.
Di Wang +4 more
wiley +1 more source
Total chromatic number of generalized Mycielski graphs
, 2014 International audienceA total coloring of a simple graph $G$ is a coloring of both the edges and the vertices. A total coloring is proper if no two adjacent or incident elements reveive the same color.
Zhang, Lianzhu +3 more
core +3 more sources
The b-Chromatic Number of Star Graph Families
Le Matematiche, 2010 In this paper, we investigate the b-chromatic number of central graph, middle graph and total graph of star graph, denoted by C(K1,n), M(K1,n) and T(K1,n) respectively.
Vivin J. Vernold, M. Venkatachalam
doaj
HeaTrace: A Parametric Design‐to‐Fabrication Workflow for Thermally Programmable Soft Robots
Advanced Intelligent Systems, EarlyView.A programmable thermal actuation workflow enables soft robots to be designed and fabricated with embedded heaters that drive multiple responses. By combining performance‐driven heater design with multimaterial fabrication, the system supports thermally triggered shape change, stiffness tuning, and thermochromic visual response, as demonstrated through ...
Naresh Kumar Thanigaivel +9 more
wiley +1 more source
Invertible Graphs of Finite Groups [PDF]
Computer Science Journal of Moldova, 2018 We investigate some properties of invertible graphs of finite groups, which are newly defined in this paper. The main results have been proved using finite group classification.
T. Chalapathi, R.V.M.S.S. Kiran Kumar
doaj
Polarization‐Dependence of Nonlinear Optical Effects in Silicon: The Case of Ultrafast Processing
Advanced Physics Research, EarlyView.The dependence of the input polarization for the nonlinear optical propagation in silicon is investigated theoretically and experimentally. The perturbative regime is examined using pump‐probe shadowgraphy and nonlinear transmission, whereas the case of permanent laser‐induced modifications is addressed using a combination of Raman micro‐spectroscopy ...
Namig Alasgarzade +6 more
wiley +1 more source