Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.

An important issue in wireless networks is the design and analysis of strategies for tracking mobile users. Several strategies have been proposed that aim at balancing the cost of updating the user position and the cost of locating a mobile user. The recently proposed reporting center strategy partitions the cellular network into reporting and non-reporting cells, and associates with each repor...

The growing interest in graph deep learning has led to a surge of research focusing on various characteristics graph-structured data. Directed graphs have generally been treated as incidental definitions the more general class undirected graphs. implicit imbalance some problems also proves difficult tackle. Moreover, body work begun grow that considers how learn signals structured edges In this...

A functional concern – code that helps fulfill a functional requirement – is typically implemented by collaborative software modules. When a developer modifies or reuses the implementation of a functional concern, he must find the modules contributing to the concern and understand how the units collaborate with one another. In this paper, we describe an approach for locating the code contributi...

The use of statistical measures to constrain generalisa-tion in learning systems has proved successful in many domains, but can only be applied where large numbers of examples exist. In domains where few training examples are available, other mechanisms for constraining gener-alisation are required. In this paper, we propose a representation of background knowledge based on arguments for and ag...

This paper is concerned with the problem of locating the code area related to software potential fault quickly and accurately in software testing period. A new method Sig BB based on graph model is proposed for mining the suspicious fault nodes from the passing and failing execution graphs. Representing each execution of a program as a graph, the graphs are divided into the passing and failing ...

We have presented an 2 ( ) O m time algorithm for locating the g-centroid for Ptolemaic graphs, where n is the number of edges and m is the number of vertices of the graph under consideration [6]. If the graph is sparse (i.e. = ( ) m O n ) then the algorithm presented will output the g-centroid in quadratic time. However, for several practical applications, the graph under consideration will be...

Let $G$ be a graph with eigenvalues $lambda_1(G)geqcdotsgeqlambda_n(G)$. In this paper we find all simple graphs $G$ such that $G$ has at most twelve vertices and $G$ has exactly two non-negative eigenvalues. In other words we find all graphs $G$ on $n$ vertices such that $nleq12$ and $lambda_1(G)geq0$, $lambda_2(G)geq0$ and $lambda_3(G)0$, $lambda_2(G)>0$ and $lambda_3(G)

The use of statistical measures to constrain generalisa-tion in learning systems has proved successful in many domains, but can only be applied where large numbers of examples exist. In domains where few training examples are available, other mechanisms for constraining gener-alisation are required. In this paper, we propose a representation of background knowledge based on arguments for and ag...