Results 61 to 70 of about 407,230 (195)
Magnetic Supraparticles as Identifiers in Single‐Layer Lithium‐Ion Battery Pouch Cells
ChemSusChem, Volume 18, Issue 6, March 15, 2025.As an alternative to externally applied optical identifiers, magnetic supraparticles (SPs) can be used for contactless identification of lithium‐ion battery pouch cells via magnetic particle spectroscopy. This study validated the integration and detection of magnetic markers in three model scenarios.
Sara Li Deuso +8 more
wiley +1 more source
FURTHER RESULTS ON ODD HARMONIOUS GRAPHS
, 2016 In [1] Abdel-Aal has introduced the notions of m-shadow graphs and n-splitting graphs, for all m, n ≥ 1. In this paper, we prove that, the m-shadow graphs for paths and complete bipartite graphs are odd harmonious graphs for all m ≥ 1. Also, we prove the
M. E. Abdel-Aal
core +1 more source
Odd sum labeling of graphs obtained by duplicating any edge of some graphs [PDF]
, 2015 An injective function $f:V(G)\rightarrow \{0,1,2,\dots,q\}$ is an odd sum labeling if the induced edge labeling $f^*$ defined by $f^*(uv)=f(u)+f(v),$ for all $uv\in E(G),$ is bijective and $f^*(E(G))=\{1,3,5,\dots,2q-1\}.$ A graph is said to be an odd ...
S. Arockiaraj +5 more
core +1 more source
European Journal of Inorganic Chemistry, EarlyView.Rollover cyclometalation is a distinctive variant of classical cyclometalation where a chelated heterocyclic ligand undergoes internal rotation, releasing one donor atom from coordination and subsequently activating a remote C─H bond with high regioselectivity.
Antonio Zucca, Maria I. Pilo
wiley +1 more source
GRACEFUL LABEING AND RHO TOPI LABELING ON THE 8-BINTANG GRAPH WITH C3 FOR N ODD [PDF]
, 2019 This paper we propose graceful labeling and labeling on a graph then referred to as 8-Bintang graph, the basic idea of formulation graceful labeling and labeling on an alfabet bintang graphs wih the question a stars graph .
Amri, Zulfi; Universitas Muhammadiyah Sumatera Utara +2 more
core +2 more sources
Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays
Journal of Combinatorial Designs, EarlyView.ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley +1 more source
On Odd Covers of Cliques and Disjoint Unions
Journal of Graph Theory, EarlyView.ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan +7 more
wiley +1 more source
Computation of Even-Odd Harmonious Labeling of Certain Family of Acyclic Graphs
International Journal of Engineering and Advanced Technology, 2019 Let ( ) , GVE be a graph with p number of vertices and q number of edges. An injective function f :V →1, 3, 5, , 2 p −1 is called an even-odd harmonious labeling of the graph G if there exists an induced edge function : →0,2,,2( −1) * f E q such that i) * f is bijective function ii) ( = ) = ( ( ) + ( ))( 2 ) * f e uv f u f v mod q The graph ...
M. Kalaimathi, B. J. Balamurugan
openaire +1 more source
Flexible List Coloring of Graphs With Maximum Average Degree Less Than 3
Journal of Graph Theory, EarlyView.ABSTRACT In the flexible list coloring problem, we consider a graph G $G$ and a color list assignment L $L$ on G $G$, as well as a subset U ⊆ V ( G ) $U\subseteq V(G)$ for which each u ∈ U $u\in U$ has a preferred color p ( u ) ∈ L ( u ) $p(u)\in L(u)$. Our goal is to find a proper L $L$‐coloring ϕ $\phi $ of G $G$ such that ϕ ( u ) = p ( u ) $\phi (u)=
Richard Bi, Peter Bradshaw
wiley +1 more source
Obstructions for Homomorphisms to Odd Cycles in Series‐Parallel Graphs
Journal of Graph Theory, EarlyView.ABSTRACT For a graph H $H$, an H $H$‐colouring of a graph G $G$ is a vertex mapping ϕ : V ( G ) → V ( H ) $\phi :V(G)\to V(H)$ such that adjacent vertices are mapped to adjacent vertices. A graph G $G$ is C 2 k + 1 ${C}_{2k+1}$‐critical if G $G$ has no C 2 k + 1 ${C}_{2k+1}$‐colouring but every proper subgraph of G $G$ has a C 2 k + 1 ${C}_{2k+1 ...
Eun‐Kyung Cho +3 more
wiley +1 more source