scholarly journals Classification of Upper Bound Sequences of Local Fractional Metric Dimension of Rotationally Symmetric Hexagonal Planar Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-24
Author(s):  
Shahbaz Ali ◽  
Muhammad Khalid Mahmood ◽  
Fairouz Tchier ◽  
F. M. O. Tawfiq

The term metric or distance of a graph plays a vital role in the study to check the structural properties of the networks such as complexity, modularity, centrality, accessibility, connectivity, robustness, clustering, and vulnerability. In particular, various metrics or distance-based dimensions of different kinds of networks are used to resolve the problems in different strata such as in security to find a suitable place for fixing sensors for security purposes. In the field of computer science, metric dimensions are most useful in aspects such as image processing, navigation, pattern recognition, and integer programming problem. Also, metric dimensions play a vital role in the field of chemical engineering, for example, the problem of drug discovery and the formation of different chemical compounds are resolved by means of some suitable metric dimension algorithm. In this paper, we take rotationally symmetric and hexagonal planar networks with all possible faces. We find the sequences of the local fractional metric dimensions of proposed rotationally symmetric and planar networks. Also, we discuss the boundedness of sequences of local fractional metric dimensions. Moreover, we summarize the sequences of local fractional metric dimension by means of their graphs.

2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Muhammad Javaid ◽  
Muhammad Kamran Aslam ◽  
Jia-Bao Liu

Distance-based numeric parameters play a pivotal role in studying the structural aspects of networks which include connectivity, accessibility, centrality, clustering modularity, complexity, vulnerability, and robustness. Several tools like these also help to resolve the issues faced by the different branches of computer science and chemistry, namely, navigation, image processing, biometry, drug discovery, and similarities in chemical compounds. For this purpose, in this article, we are considering a family of networks that exhibits rotationally symmetric behaviour known as circular ladders consisting of triangular, quadrangular, and pentagonal faced ladders. We evaluate their upper bounds of fractional metric dimensions of the aforementioned networks.


2021 ◽  
Vol 5 (4) ◽  
pp. 276
Author(s):  
Muhammad Javaid ◽  
Muhammad Kamran Aslam ◽  
Muhammad Imran Asjad ◽  
Bander N. Almutairi ◽  
Mustafa Inc ◽  
...  

The distance centric parameter in the theory of networks called by metric dimension plays a vital role in encountering the distance-related problems for the monitoring of the large-scale networks in the various fields of chemistry and computer science such as navigation, image processing, pattern recognition, integer programming, optimal transportation models and drugs discovery. In particular, it is used to find the locations of robots with respect to shortest distance among the destinations, minimum consumption of time, lesser number of the utilized nodes, and to characterize the chemical compounds, having unique presentations in molecular networks. After the arrival of its weighted version, known as fractional metric dimension, the rectification of distance-related problems in the aforementioned fields has revived to a great extent. In this article, we compute fractional as well as local fractional metric dimensions of web-related networks called by subdivided QCL, 2-faced web, 3-faced web, and antiprism web networks. Moreover, we analyse their final results using 2D and 3D plots.


2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Muhammad Javaid ◽  
Saira Javed ◽  
Abdulaziz Mohammed Alanazi ◽  
Majdah R. Alotaibi

Numerous studies based on mathematical models and tools indicate that there is a strong inherent relationship between the chemical properties of the chemical compounds and drugs with their molecular structures. In the last two decades, the graph-theoretic techniques are frequently used to analyse the various physicochemical and structural properties of the molecular graphs which play a vital role in chemical engineering and pharmaceutical industry. In this paper, we compute Zagreb indices of the generalized sum graphs in the form of the different indices of their factor graphs, where generalized sum graphs are obtained under the operations of subdivision and strong product of graphs. Moreover, the obtained results are illustrated with the help of particular classes of graphs and analysed to find the efficient subclass with dominant indices.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 82404-82420 ◽  
Author(s):  
Jia-Bao Liu ◽  
Muhammad Kamran Aslam ◽  
Muhammad Javaid

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Muhammad Javaid ◽  
Hassan Zafar ◽  
Amer Aljaedi ◽  
Abdulaziz Mohammad Alanazi

Metric dimension is one of the distance-based parameter which is frequently used to study the structural and chemical properties of the different networks in the various fields of computer science and chemistry such as image processing, pattern recognition, navigation, integer programming, optimal transportation models, and drugs discovery. In particular, it is used to find the locations of robots with respect to shortest distance among the destinations, minimum consumption of time, and lesser number of the utilized nodes and to characterize the chemical compounds having unique presentation in molecular networks. The fractional metric dimension being a latest developed weighted version of the metric dimension is used in the distance-related problems of the aforementioned fields to find their nonintegral optimal solutions. In this paper, we have formulated the local resolving neighborhoods with their cardinalities for all the edges of the convex polytopes networks to compute their local fractional metric dimensions in the form of exact values and sharp bounds. Moreover, the boundedness of all the obtained results is also proved.


Author(s):  
M. Jeyanthi ◽  
C. Velayutham

In Science and Technology Development BCI plays a vital role in the field of Research. Classification is a data mining technique used to predict group membership for data instances. Analyses of BCI data are challenging because feature extraction and classification of these data are more difficult as compared with those applied to raw data. In this paper, We extracted features using statistical Haralick features from the raw EEG data . Then the features are Normalized, Binning is used to improve the accuracy of the predictive models by reducing noise and eliminate some irrelevant attributes and then the classification is performed using different classification techniques such as Naïve Bayes, k-nearest neighbor classifier, SVM classifier using BCI dataset. Finally we propose the SVM classification algorithm for the BCI data set.


2016 ◽  
Vol 136 (8) ◽  
pp. 1120-1127 ◽  
Author(s):  
Naoya Ikemoto ◽  
Kenji Terada ◽  
Yuta Takashina ◽  
Akio Nakano

Author(s):  
Yashpal Jitarwal ◽  
Tabrej Ahamad Khan ◽  
Pawan Mangal

In earlier times fruits were sorted manually and it was very time consuming and laborious task. Human sorted the fruits of the basis of shape, size and color. Time taken by human to sort the fruits is very large therefore to reduce the time and to increase the accuracy, an automatic classification of fruits comes into existence.To improve this human inspection and reduce time required for fruit sorting an advance technique is developed that accepts information about fruits from their images, and is called as Image Processing Technique.


2013 ◽  
Vol 38 (2) ◽  
pp. 374-379 ◽  
Author(s):  
Zhi-Li PAN ◽  
Meng QI ◽  
Chun-Yang WEI ◽  
Feng LI ◽  
Shi-Xiang ZHANG ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document