Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
5 results
Search Results
Item Relation between k-DRD and dominating set(Springer International Publishing, 2019) Kamath, S.S.; Senthil Thilak, A.; M, R.In this paper, a new parameter on domination is defined by imposing a restriction on the degrees of vertices in the dominating set. For a positive integer k, a dominating set D of a graph G is said to be a k-part degree restricted dominating set (k-DRD-set), if for all u ∈ D there exists a set C u ⊆ N(u) ∩ (V − D) such that |Cu|≤⌈d(u)k⌉ and ⋃ u ∈ D C u = V − D. The minimum cardinality of a k-part degree restricted dominating set of G is called the k-part degree restricted domination number of G and is denoted by γdk(G). Here, we determine the k-part degree restricted domination number of some well-known graphs, relation between dominating and k-DRD set, and an algorithm which verifies whether a given dominating set is a k-DRD set or not. © Springer Nature Switzerland AG 2019.Item Diagnosis of Autism Spectrum Disorder Using Context-Based Pooling and Cluster-Graph Convolution Networks(Springer, 2023) Sai Prasanna, M.S.; Senthil Thilak, A.Autism spectrum disorder (ASD) is a neurological disorder that causes impairment in the healthy development of a subject’s analytic and social skills. Several studies exist in the literature on the diagnosis of ASD using machine learning, kernel-based learning, and deep learning techniques. Most of these depend on the correlation values between regions of interest in a human brain and ignore the non-anatomical phenotypical data associated with the subjects. This leads to non-uniform measurements concerning various data sources. As an attempt to bridge this gap, this paper considers both anatomical and phenotypical features. We propose a new graph-based machine learning architecture which uses graph-theoretic biomarkers for diagnosing ASD. The model uses node ranking, message passing mechanism, graph embedding, and cluster-graph convolution network for classification. Further, the model is implemented on a benchmark real-time dataset containing MRI, fMRI, and phenotypical data collected through multiple international resources. The results obtained show that the proposed model outperforms the state-of-the-art models. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.Item Impact of realistic mobility models on the performance of VANET routing protocols(Institute of Electrical and Electronics Engineers Inc., 2023) Sundari, K.; Senthil Thilak, A.Vehicular ad hoc networks (VANETs) are a special class of ad hoc networks, wherein vehicles integrated with computing and communication capabilities exchange information among themselves and the roadside units through wireless media. Vehicular communication plays a vital role in Intelligent Transportation Systems (ITS), especially to ensure safety and traffic management. Further, VANET communication finds wide application in autonomous driving systems. With the massive increase in the number of vehicles being used and prevailing complex traffic conditions, designing routing protocols for efficient communication in VANETs has become more challenging and captured the attention of the research community. In the process of developing new routing protocols, it is prohibitively expensive to deploy real-world test beds to analyze the efficiency of new protocols against the existing ones. Hence, research in vehicular communication greatly depends on simulation. Due to the highly dynamic nature of vehicles in real-time traffic environments, an appropriate choice of mobility models that accurately reflect real-world traffic behavior has a greater impact in the study on performance analysis of VANET routing protocols. In view of this, this paper explores the impact of the most commonly used realistic mobility models on the performance of VANET routing protocols, under varied real-world traffic scenarios. The performance of different routing protocols is compared with respect to the QoS metrics, namely, average goodput, MacPhy overhead, and BSM packet delivery ratio. Simulators such as Network Simulator 3 (NS3) and Simulation of Urban Mobility (SUMO) were used to conduct the experiment. © 2023 IEEE.Item Algorithmic aspects of k-part degree restricted domination in graphs(World Scientific wspc@wspc.com.sg, 2020) Kamath, S.S.; Senthil Thilak, A.; Rashmi, M.The concept of network is predominantly used in several applications of computer communication networks. It is also a fact that the dominating set acts as a virtual backbone in a communication network. These networks are vulnerable to breakdown due to various causes, including traffic congestion. In such an environment, it is necessary to regulate the traffic so that these vulnerabilities could be reasonably controlled. Motivated by this, k-part degree restricted domination is defined as follows. For a positive integer k, a dominating set D of a graph G is said to be a k-part degree restricted dominating set (k-DRD set) if for all u ? D, there exists a set Cu ? N(u) ?(V ? D) such that |Cu| ? ?d(ku) ? and Su?D Cu = V ? D. The minimum cardinality of a k-DRD set of a graph G is called the k-part degree restricted domination number of G and is denoted by ? dk (G). In this paper, we present a polynomial time reduction that proves the NP-completeness of the k-part degree restricted domination problem for bipartite graphs, chordal graphs, undirected path graphs, chordal bipartite graphs, circle graphs, planar graphs and split graphs. We propose a polynomial time algorithm to compute a minimum k-DRD set of a tree and minimal k-DRD set of a graph. © 2020 World Scientific Publishing Co. Pte Ltd. All rights reserved.Item Bounds on k-part degree restricted domination number of a graph(Tsing Hua University, 2021) Kamath, S.S.; Senthil Thilak, A.; Maladi, R.For a positive integer k, a dominating set D of a graph G is said to be a k-part degree reslrictedm dominating set (k-DRD set) if for all u 2 D, there exists a set [Formula Presented] The minimum cardinality of a k-DRD set of a graph G is called the k-part degree restricted domination number of G and is denoted by ?d/k (G). In this paper, we provide some bounds on ?d/k of join of two graphs, bounds on ?d/k in terms of maximum degree, independence number and covering number. Further, we discuss some Nordhaus-Gaddum type results. In addition to this, we prove that for any graph G, ?d/k (G)??k (G), where ?k (G) is the k-domination number of G and we characterize the trees T for which ?d/k(?)= ?k(G). © 2021, Tsing Hua University. All rights reserved.