• Annals of Fuzzy Mathematics and Informatics
• /
• 제16권3호
• /
• pp.301-316
• /
• 2018

In this paper, the concept of connected geodesic number, $gn_c(G)$, of a fuzzy graph G is introduced and its limiting bounds are identified. It is proved that all extreme nodes of G and all cut-nodes of the underlying crisp graph $G^*$ belong to every connected geodesic cover of G. The connected geodesic number of complete fuzzy graphs, fuzzy cycles, fuzzy trees and of complete bipartite fuzzy graphs are obtained. It is proved that for any pair k, n of integers with $3{\leq}k{\leq}n$, there exists a connected fuzzy graph G : (V, ${\sigma}$, ${\mu}$) on n nodes such that $gn_c(G)=k$. Also, for any positive integers $2{\leq}a<b{\leq}c$, it is proved that there exists a connected fuzzy graph G : (V, ${\sigma}$, ${\mu}$) such that the geodesic number gn(G) = a and the connected geodesic number $gn_c(G)=b$.

• International Journal of Internet, Broadcasting and Communication
• /
• 제14권1호
• /
• pp.53-63
• /
• 2022

In the paper, we propose a TSCH-based scheduling scheme for IEEE 802.15.4e, which is able to perform the scheduling of its own network by avoiding collision from interference network cluster (INC). Firstly, we model a bipartite graph structure for presenting the slot-frame (channel-slot assignment) of TSCH. Then, based on the bipartite graph edge weight, we utilize the Hungarian assignment algorithm to implement a scheduling scheme. We have employed two features (maximization and minimization) of the Hungarian-based assignment algorithm, which can perform the assignment in terms of minimizing the throughput of INC and maximizing the throughput of own network. Further, in this work, we called the scheme "dual-stage Hungarian-based assignment algorithm". Furthermore, we also propose deep learning (DL) based deep neural network (DNN)scheme, where the data were generated by the dual-stage Hungarian-based assignment algorithm. The performance of the DNN scheme is evaluated by simulations. The simulation results prove that the proposed DNN scheme providessimilar performance to the dual-stage Hungarian-based assignment algorithm while providing a low execution time.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.491-495
• /
• 1993

In this paper, we present a methodology to model an indoor environment of a mobile robot using fuzzy numbers and to make a global map of the robot environment using graph theory. We describe any geometric primitive of robot environment as a parameter vector in parameter space and represent the ill-known values of the prameterized geometric primitive by means of fuzzy numbers restricted to appropriate membership functions. Also we describe the spatial relations between geometric prinitives using graph theory for local maps. For making the global map of the mobile robot environment, the correspondence problem between local maps is solved using a fuzzy similarity measure and a Bipartite graph matching technique.

• Journal of Communications and Networks
• /
• 제15권3호
• /
• pp.321-328
• /
• 2013

In this paper, we present a technique for obtaining conflict-free schedules for real-time automation protocol for industrial Ethernet (RAPIEnet) switches. Mathematical model of the switch is obtained using graph theory. Initially network traffic entry and exit parts in a single RAPIEnet switch are identified, so that a bipartite conflict graph can be constructed. The obtained conflict graph is transformed to three kinds of matrices to be used as inputs for our simulation model, and selection of any of the matrix forms is application-specific. A greedy edge-coloring algorithm is used to schedule the network traffic and to solve the minimum coloring problem. After scheduling, empty slots are identified for forwarding the non real-time traffic of asynchronous devices. Finally, an algorithm for synchronizing the schedules of adjacent switches is proposed using edge-contraction and minors. All simulations were carried out using Matlab.

• Kyungpook Mathematical Journal
• /
• 제63권3호
• /
• pp.355-372
• /
• 2023

We make advances towards a structural characterisation of the signed graphs H for which the list switch H-colouring problem List-S-Hom(H) can be solved in polynomial time. We conjecture two different characterisations, the second refining the first, in the case that the graph H can be switched to a graph in which every negative edge is also positive. Using a recent proof of the first characterisations for reflexive signed graphs, by Bok et. al., we prove the second characterisation for reflexive signed graphs. We also provide several tools for reducing the problem to the bipartite case, and prove a full complexity dichotomy for a related problem.

• Journal of Information Processing Systems
• /
• 제14권4호
• /
• pp.961-979
• /
• 2018

For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.

• 대한수학회지
• /
• 제51권1호
• /
• pp.87-98
• /
• 2014

Let R be a commutative ring with identity and M an R-module. In this paper, we associate a graph to M, say ${\Gamma}(M)$, such that when M = R, ${\Gamma}(M)$ is exactly the classic zero-divisor graph. Many well-known results by D. F. Anderson and P. S. Livingston, in [5], and by D. F. Anderson and S. B. Mulay, in [6], have been generalized for ${\Gamma}(M)$ in the present article. We show that ${\Gamma}(M)$ is connected with $diam({\Gamma}(M)){\leq}3$. We also show that for a reduced module M with $Z(M)^*{\neq}M{\backslash}\{0\}$, $gr({\Gamma}(M))={\infty}$ if and only if ${\Gamma}(M)$ is a star graph. Furthermore, we show that for a finitely generated semisimple R-module M such that its homogeneous components are simple, $x,y{\in}M{\backslash}\{0\}$ are adjacent if and only if $xR{\cap}yR=(0)$. Among other things, it is also observed that ${\Gamma}(M)={\emptyset}$ if and only if M is uniform, ann(M) is a radical ideal, and $Z(M)^*{\neq}M{\backslash}\{0\}$, if and only if ann(M) is prime and $Z(M)^*{\neq}M{\backslash}\{0\}$.

• Journal of the Korean Statistical Society
• /
• 제23권2호
• /
• pp.513-522
• /
• 1994

A multi-dimensional design is most easily constructed via the amalgamation of one-dimensional component block designs. However, not all sets of component designs are compatible to be amalgamated. The conditions for compatibility are related to the concept of a complete matching in a graph. In this paper, we give sufficient conditions for unequal-replicate designs. Two types of conditions are proposed; one is based on the number of verices adjacent to at least one vertex and the other is ona a degree of vertex, in a bipartite graph. The former is an extension of the sufficient conditions of equal-replicate designs given by Dean an Lewis (1988).

• 대한수학회보
• /
• 제52권2호
• /
• pp.467-481
• /
• 2015

Choi and Park introduced an invariant of a finite simple graph, called signed a-number, arising from computing certain topological invariants of some specific kinds of real toric manifolds. They also found the signed a-numbers of path graphs, cycle graphs, complete graphs, and star graphs. We introduce a signed a-polynomial which is a generalization of the signed a-number and gives a-, b-, and c-numbers. The signed a-polynomial of a graph G is related to the $Poincar\acute{e}$ polynomial $P_{M(G)}(z)$, which is the generating function for the Betti numbers of the real toric manifold M(G). We give the generating functions for the signed a-polynomials of not only path graphs, cycle graphs, complete graphs, and star graphs, but also complete bipartite graphs and complete multipartite graphs. As a consequence, we find the Euler characteristic number and the Betti numbers of the real toric manifold M(G) for complete multipartite graphs G.

• 대한수학회논문집
• /
• 제24권2호
• /
• pp.161-169
• /
• 2009

In this paper, we introduce the generalized ideal-based zero-divisor graph structure of near-ring N, denoted by $\widehat{{\Gamma}_I(N)}$. It is shown that if I is a completely reflexive ideal of N, then every two vertices in $\widehat{{\Gamma}_I(N)}$ are connected by a path of length at most 3, and if $\widehat{{\Gamma}_I(N)}$ contains a cycle, then the core K of $\widehat{{\Gamma}_I(N)}$ is a union of triangles and rectangles. We have shown that if $\widehat{{\Gamma}_I(N)}$ is a bipartite graph for a completely semiprime ideal I of N, then N has two prime ideals whose intersection is I.