Results 31 to 40 of about 597 (229)
Total Vertex Irregularity Strength of Forests
, 2011 We investigate a graph parameter called the total vertex irregularity strength ($tvs(G)$), i.e. the minimal $s$ such that there is a labeling $w: E(G)\cup V(G)\rightarrow \{1,2,..,s\}$ of the edges and vertices of $G$ giving distinct weighted degrees $wt_G(v):=w(v)+\sum_{v\in e \in E(G)}w(e)$ for every pair of vertices of $G$.
Anholcer, Marcin +2 more
openaire +2 more sources
The total disjoint irregularity strength of some certain graphs
Indonesian Journal of Combinatorics, 2020 Under a totally irregular total k-labeling of a graph G = (V, E), we found that for some certain graphs, the edge-weight set W (E) and the vertex-weight set W (V ) of G which are induced by k=ts(G), W(E)∩W(V) is a non empty set.
Meilin I Tilukay, A. N. M. Salman
doaj +1 more source
Total Distance Vertex Irregularity Strength of Hairy Cycle C_m^n Graph
INTI Journal, 2022 A total graph labeling is an assignment of integers to the union of vertices and edges to certain conditions. The labeling becomes D -distance vertex irregular total k-labeling when each vertex of G has a different weight (which is determined by D-distance neighborhood). The total distance vertex irregularity strength of G denoted by tdis(G) and define
Ida Wijayanti +2 more
openaire +1 more source
Totally irregular total labeling of some caterpillar graphs
Electronic Journal of Graph Theory and Applications, 2020 Assume that G(V,E) is a graph with V and E as its vertex and edge sets, respectively. We have G is simple, connected, and undirected. Given a function λ from a union of V and E into a set of k-integers from 1 until k.
Diari Indriati +4 more
doaj +1 more source
Irregular labelings of helm and sun graphs
AKCE International Journal of Graphs and Combinatorics, 2015 A vertex irregular total k-labeling of a (p,q)-graph G=(V,E) is a labeling ϕ:V∪E→{1,2,…,k} such that the weights of the vertices wt(v)=ϕ(v)+∑uv∈Eϕ(uv) are different for all vertices.
Ali Ahmad +2 more
doaj +1 more source
Indonesian Journal of Combinatorics, 2020 Given graph G(V,E). We use the notion of total k-labeling which is edge irregular. The notion of total edge irregularity strength (tes) of graph G means the minimum integer k used in the edge irregular total k-labeling of G.
Isnaini Rosyida, Diari Indriati
doaj +1 more source
Advanced Functional Materials, EarlyView.Lipid nanoparticles (LNPs) are optimized to co‐deliver Cas9‐encoding messenger RNA (mRNA), a single guide RNA (sgRNA) targeting the endogenous cystic fibrosis transmembrane conductance regulator (CFTR) gene, and homologous linear double‐stranded donor DNA (ldsDNA) templates encoding CFTR.
Ruth A. Foley +12 more
wiley +1 more source
ON THE TOTAL VERTEX IRREGULARITY STRENGTHS OF QUADTREES AND BANANA TREES [PDF]
Journal of the Indonesian Mathematical Society, 2012 pdf abstractDOI : http://dx.doi.org/10.22342/jims.18.1.107.31 ...
openaire +2 more sources
Advanced Functional Materials, EarlyView.Viscoelasticity‐driven instabilities are harnessed to create tunable, periodic textures in 3D‐printed liquid crystalline polymers. This study illustrates how processing parameters control these spontaneous meso‐scale patterns. These unique structural architectures unlock new possibilities for functional devices, ranging from photonic components to ...
Miaomiao Zou +17 more
wiley +1 more source
Total vertex irregularity strength of disjoint union of Helm graphs
Discussiones Mathematicae Graph Theory, 2012 A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1, 2, . . . , k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the ...
Ali Ahmad, Edy Tri Baskoro, M. Imran
openaire +1 more source