Results 91 to 100 of about 2,693,458 (344)
Lucas Gracefulness of Almost and Nearly for Some Graphs [PDF]
, 2011 By a graph, we mean a finite undirected graph without loops or multiple ...
Perumal, M.A. +2 more
core +1 more source
- and -labeling problems on interval graphs
AKCE International Journal of Graphs and Combinatorics, 2017 For a given graph , the - and -labeling problems assign the labels to the vertices of . Let be the set of non-negative integers. An - and -labeling of a graph is a function such that , for respectively, where represents the distance (minimum number of ...
Sk Amanathulla, Madhumangal Pal
doaj +1 more source
Computing The Irregularity Strength of Planar Graphs
Mathematics, 2018 The field of graph theory plays a vital role in various fields. One of the important areas in graph theory is graph labeling used in many applications such as coding theory, X-ray crystallography, radar, astronomy, circuit design, communication network ...
Hong Yang +4 more
doaj +1 more source
Prime labeling in the context of web graphs without center
AKCE International Journal of Graphs and Combinatorics, 2021 A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels.
A. N. Kansagara, S. K. Patel
doaj +1 more source
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tridib Dutta +3 more
openaire +1 more source
On Universal Cycles of Labeled Graphs [PDF]
The Electronic Journal of Combinatorics, 2010 A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple graphs, trees, graphs with $m$ edges, graphs with loops, graphs with multiple edges (with up to $m$ duplications of each edge), directed graphs, hypergraphs, and $k ...
Greg Brockman, Bill Kay, Emma E. Snively
openaire +3 more sources
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
On Lh,k-Labeling Index of Inverse Graphs Associated with Finite Cyclic Groups
Journal of Mathematics, 2021 An Lh,k-labeling of a graph G=V,E is a function f:V⟶0,∞ such that the positive difference between labels of the neighbouring vertices is at least h and the positive difference between the vertices separated by a distance 2 is at least k.
K. Mageshwaran +4 more
doaj +1 more source
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
FEBS Letters, EarlyView.Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa +2 more
wiley +1 more source
Heinz Quarter Mean Labeling of Graphs
Ratio MathematicaMean labeling is one of the best-known labeling methods for graphs. Despite the large number of papers published on the subject of graph labeling, there are some particular formulas to be used by researchers to mean-label graphs.
Latha S, Sandhya SS
doaj +1 more source