Results 81 to 90 of about 828 (253)
All Quiet on the Luxury Front: How and When Sustainability Labels Influence Purchase Behavior
Journal of Consumer Behaviour, EarlyView.ABSTRACT As luxury brands launch sustainability initiatives and products, they face significant challenges, including the need to effectively communicate their practices to consumers. The current research draws on semiotics theory to explore how and when distinct types of sustainability labels, indexical and iconic, enhance brand authenticity ...
Shelly Rathee +2 more
wiley +1 more source
Chemistry – A European Journal, EarlyView.Cyclopropylamines have emerged as powerful photocatalytic building blocks. Upon light‐induced single‐electron oxidation, they undergo strain‐release ring opening to generate distonic iminium radicals that enable diverse transformations, including ring‐opening functionalization, formal [3 + 2] cycloadditions, radical cascades, and asymmetric bond ...
Maria Chiara Cabua +3 more
wiley +1 more source
International Journal of Mathematics and Soft Computing, 2014 A ( p, q) graph G(V, E) is said to be a square graceful graph if there exists an injection f :V(G)---{0,1,2,3,..., q2 } such that the induced mapping f p : E(G) --- {1, 4, 9,..., q2} defined by f (uv)=| f (u) f (v)| p = ? is a bijection. The function f is called a square labeling of G . In this paper, we prove that the star n K 1, , bistar m n B , ,
P. B. Sarasija, T. Tharmaraj
openaire +1 more source
Chemistry – A European Journal, EarlyView.The development of chiral pda derived methoxy ligands L1a [1(R,R)] and L1b [1(S,S)], along with their phenol derivatives L2a [2(R,R)] and L2b [2(S,S)], and their respective Tb(III) complexes is described. These Tb‐complexes exhibited Tb(III)‐centered emission upon and their chiroptical properties were probed by using both CD and CPL spectroscopy ...
Jennifer E. Jones +3 more
wiley +1 more source
Applications of mathematical programming in graceful labeling of graphs
Journal of Applied Mathematics, 2004 Graceful labeling is one of the best known labeling methods of graphs. Despite the large number of papers published on the subject of graph labeling, there are few particular techniques to be used by researchers to gracefully label graphs. In this paper,
Kourosh Eshghi, Parham Azimi
doaj +1 more source
Chemistry – A European Journal, EarlyView.Balancing Act: Se─M bond serving as the fulcrum of the balance scale to compare the different weight of toxicity and therapeutic effects in biological environment. ABSTRACT The synthesis and characterization of organo‐selenium compounds have attracted considerable interest for decades, driven by the search for efficient catalysts and bioinspired ...
Matteo Filippi +6 more
wiley +1 more source
Special Graceful Labelings of Irregular Fences and Lobsters
Universal Journal of Mathematics and Applications, 2019 Irregular fences are subgraphs of $P_m \times P_n$ formed with $m$ copies of $P_n$ in such a way that two consecutive copies of $P_n$ are connected with one or two edges; if two edges are used, then they are located in levels separated an odd number of ...
Christian Barrientos
doaj +1 more source
On the graceful polynomials of a graph.
Australas. J Comb., 2019 Every graph can be associated with a family of homogeneous polynomials, one for every degree, having as many variables as the number of vertices. These polynomials are related to graceful labellings: a graceful polynomial with all even coefficients is a basic tool, in some cases, for proving that a graph is non-graceful, and for generating a possibly ...
openaire +2 more sources
The Canadian Journal of Chemical Engineering, EarlyView.Abstract Engineering graduate students confuse the scientific method and problem solving when presenting their pre‐doctoral exams and theses: Science discourse adopts question and hypotheses to assert and establish a study's rationale, while it is problem and objectives in engineering design.
Gregory S. Patience +4 more
wiley +1 more source
Graceful Labeling of some Join Graphs and the Subdivision of Complete Bipartite Graphs
Journal of Applied MathematicsThe join of graphs G and H, denoted by G+H, is the graph obtained from the disjoint union of G and H by joining each vertex in G to each vertex in H. An edge uw is said to be subdivided if uw is replaced by the path P:uvw, where v is the new vertex.
A. Panpa, P. Chaiprasert, C. Tisklang
doaj +1 more source