Search
Now showing items 71-80 of 81
Edge-magic total labelings of wheels, fans and friendship graphs
(Bulletins of ICA, 2002)
An edge-magic total labeling on a graph with v vertices and e
edges will be defined as a one-to-one map taking the vertices and
edges onto the integers 1, 2, · · · , v+e with the property that the sum
of the label on ...
Diregularity of digraphs of out-degree three and order two less than Moore bound
(Proceeding of 12th Australasian Workshop on Combinatorial Algorithms, 2001)
It is easy to show that any digraph with out-degree at most $d \ge 2$, diameter $k \ge 2$ and order $n=d+d^2+\dots + d^k - 1$, that is, two less than Moore bound must have
all vertices of out-degree $d$. In other words, ...
Exclusive Sum Labeling of Graphs
(JCMCC, 2005)
Electropolymerisation and Characterisation of Doped-Polypyrrole as Humidity Sensor
(Indonesian Journal of Chemistry, 2006-07)
A new type of sensing materials for humidity measurement has been developed based on conducting polymer polypyrrole synthesised from pyrrole by adding some dopant compounds, bromide and chloride, it is prepared by ...
On vertex-magic total labeling of some wheel related graphs
(Utilitas Math., 2007)
Let G be a graph with vertex set V = V (G) and edge set E =
E(G) and let e = jE(G)j and v = jV (G)j. A one-to-one map ¸ from
V [ E onto the integers f1; 2; : : : ; v + eg is called vertex-magic total
labeling if there ...
MCF-7 Resistant doxorubicin are characterized by lamelapodia, strong adhesion on substrate and P-gp overexpression
(Indonesian Society of Cancer Chemoprevention, 2011)
The prognosis of breast cancer patients is closely associated with the response of tumor cells to chemotherapy agent. Doxorubicin is one of the primary chemotherapeutic agents used for the treatment of breast cancer. ...
Pemanfaatan paralel port mikrokomputer untuk pengukuran simultan empat parameter kualitas air
(Jurnal Kimia Lingkungan; Kelompok Studi Lingkungan Indonsia, 2006)
On $r$-Dynamic Coloring for Operation Product of Cycle and Cycle Graphs
(2016-02-18)
For integer $k,r>0,(k,r)$ -coloring of graph $G$ is a proper coloring on the vertices of $G$ by $k$-colors such that every vertex $v$ of degree $d(v)$ is adjacent to vertices with at least $min\{d(v),r\}$ different color. ...
On $r$-Dynamic Coloring of Operation Product of Cycle and Path Graphs
(2016-02-18)
Let $G$ be a simple, connected and undirected
graph. Let $r,k$ be natural numbers. By a proper $k$-coloring of a graph $G$, we mean a map $ c : V (G) \rightarrow S$, where $|S| =k$, Such that any two adjacent vertices ...
Super Antimagicness of Triangular Book and Diamond Ladder Graphs
(Indoms (Indonesian Mathematics Society), Department of Mathematics Universitas Gajah Mada, Indonesia., 2013-11-06)
A graph G of order p and size q is called an (a,
d)-edge-antimagic total if there exists a bijection f : V (G) U E(G)
---> {1, 2, .... , p + q} such that the edge-weights, w(uv) =
f(u)+f(v)+f(uv); uv in E(G), form an ...