# Browsing Fakultas Matematika dan Ilmu Pengetahuan Alam by Issue Date

Sort by: Order: Results:

• (2016-02-02)
A set $D$ of vertices of a simple graph $G$, that is a graph without loops and multiple edges, is called a dominating set if every vertex $u\in V(G)-D$ is adjacent to some vertex $v\in D$. The domination number of a ...
• (2016-02-02)
Let $G$ be a simple, connected and undirected graph. Let $r,k$ be natural number. 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 ...
• (2016-02-02)
A graph $G(V,E)$ has a $H$-Covering if every edge in $E$ belongs to a subgraph of $G$ isomorphic to $H$. The $(a,d)-H$ antimagic covering on the G graph is a biijective functin of $f:V(G)\cup E(G) \rightarrow ... • (2016-02-02) Let$G$be a simple, connected and undirected graph. Let$r,k$be natural number. 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 ... • (2016-02-18) All graph in this paper are finite, simple and undirected. By$H'$-covering, we mean every edge in$E(G)$belongs to at least one subgraph of$G$isomorphic to a given graph$H$. A graph$G$is said to be an$(a, ...
• (2016-02-18)
All graph in this paper are finite, simple and undirected. By $H'$-covering, we mean every edge in $E(G)$ belongs to at least one subgraph of $G$ isomorphic to a given graph $H$. A graph $G$ is said to be an $(a, ... • (2016-02-18) A graph$G(V,E)$has a$\mathcal{H}$-covering if every edge in$E$belongs to a subgraph of$G$isomorphic to$\mathcal{H}$. An$(a,d)$-$\mathcal{H}$-antimagic total covering is a total labeling$\lambda$from$V(G)\cup ...
• (2016-02-18)
A graph $G$ of order $p$, size $q$ and face $r$ is called a super $(a,d)$ - face antimagic total labelling, if there exist a bijection $f:V(G)\bigcup E(G)\bigcup F(G)$ $\rightarrow \{1,2,...,p+q+r\}$ such that the set ...
• (2016-02-18)
Diberikan suatu graf G sedehana, dan tidak berarah. $f(V)=\{1,2,3,...,p\}$ dan $f(E)=\{p+1,...,p+q\}$ dikatakan sebagai pelabelan super. Pelabelan super ({\it a,d})-${\mathcal {H}}$-antimagic total selimut merupakan ...
• (2016-02-18)
Let $G$ be a simple graph of order $p$, size $q$ and face $r$. The graph $G$ is called a super ($a,d$) - face antimagic total labeling , if there exist a bijection $f:V(G)\cup E(G)\cup F(G)$ $\rightarrow \{1,2,...,p+q+r\}$ ...
• (2016-02-18)
Graph $G=(V,E)$ is a finite, simple and undirected. Graph $G$ have $H'$ covering, if every edge in $E(G)$ belongs to at least one subgraph of $G$ isomorphic to a given graph $H$. A graph $G$ is said to be an \$(a, ...