[PDF] Top 20 COMMON-EDGE SIGNED GRAPH OF A SIGNED GRAPH | Reddy | Journal of the Indonesian Mathematical Society 34 106 1 PB

... idea of switching a signed graph was introduced by Abelson and Rosen- berg [1] in connection with structural analysis of marking µ of a signed graph ... Lihat dokumen lengkap

... consists of a finite nonempty set V of objects called vertices and a set E of ordered pairs of distinct ...element of E is an arc or a directed edge. If ... Lihat dokumen lengkap

... A common approach to finding the edge-balanced index set is to start by finding the maximum element in the set and then produce the smaller values by a series ... Lihat dokumen lengkap

... s. A graph X is said to be s-arc-transitive if Aut(X) acts transitively on the set of its ...and 1- arc-transitive means arc-transitive or symmetric. A graph X is said to ... Lihat dokumen lengkap

... be a graph with order |G| and size |E|. An (a, d)-vertex- antimagic total labeling is a bijection α from all vertices and edges to the set of consecutive integers {1, 2, ... Lihat dokumen lengkap

... Abstract. A graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E (G) → {1, 2, ...is a constant for each uv ∈ E (G) and f (V (G)) = {1, 2, ... Lihat dokumen lengkap

... be a graph with order |G| and size |E|. An (a, d)-vertex- antimagic total labeling is a bijection α from all vertices and edges to the set of consecutive integers {1, 2, ... Lihat dokumen lengkap

... The edge-balance index sets can be viewed as the dual of balance index ...sets. The balance index sets of graphs were considered in [9, 11, 12, 13, 14, 15, 17, 19, ...be a ... Lihat dokumen lengkap

... notion of sequential graphs was introduced by Grace [15]. He defined a graph G of size q to be sequential if there exists an injective function f : V (G) → [0, q − 1] (with the ... Lihat dokumen lengkap

... line graph L(G) of a graph G is a graph such that the vertices of L(G) are the edges of G and two vertices of L(G) are adjacent if and only if ... Lihat dokumen lengkap

... E. A subset D of V is called a dominating set of G if every vertex of V -D is adjacent to some vertex in ...called a minimum dominating set. Let D be a minimum dominating ... Lihat dokumen lengkap

... set of G if every edge of G is incident to one vertex in ...called a minimum covering set. Let C be a minimum covering set of a graph ...G. The minimum ... Lihat dokumen lengkap

... On the other hand, ca ∈ cSb ⊆ cSbcb ⊆ Scb and cb ∈ ...is a right congruence relation and L is a left congruence relation, and so H is a congruence ...every a, b ∈ S, a ∈ Saba and ... Lihat dokumen lengkap

... as a generalization of a stochastic process which we call an integrated Poisson process in this ...paper. The expected value of the integrated Poisson process has been discussed ... Lihat dokumen lengkap

... develop a useful mathematical model of discrete- state systems such as digital ...computers. The model will work regardless of the internal structure of the device ... Lihat dokumen lengkap

... Click here to activate Remote Access Bandung Institute of Technology ISSN 2167­5163 Journal Information for "Journal of the Indonesian Mathematical Society" J.. Journal of the Indon[r] ... Lihat dokumen lengkap

... = 1, λ = 0, δ = 0 or α = 0, λ = 1, δ = 0 we get Sˇ alˇ agean differential operator [18], k = 0 gives Ruschewyh operator [17], α = 0, δ = 0 implies Al-Oboudi differential operator of order (k) ... Lihat dokumen lengkap

... -module. The module M is called multiplication if for any submodule N of M we have N = I M , where I is an ideal of R ...properties of submodules of these modules. Also, we study ... Lihat dokumen lengkap

... generalization of the two terms recurrence can be found in [3], where the authors there use different formula for the even numbered and the odd numbered term of the ... Lihat dokumen lengkap

... is the open neighborhood of v. The constant k is called the magic constant of the labeling ...Any graph which admits a distance magic labeling is called a ... Lihat dokumen lengkap