Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Adjacency Matrix

Chapter 4
Neutrosophic Graph Theory and Algorithms
Is a connection matrix and represents the relation between the vertices whether connected or not.
Published in Chapter:
New Algorithms for Hamiltonian Cycle Under Interval Neutrosophic Environment
Nagarajan Deivanayagam Pillai (Hindustan Institute of Technology and Science, India), Lathamaheswari Malayalan (Hindustan Institute of Technology and Science, India), Said Broumi (Laboratory of Information Processing, Faculty of Science Ben M’Sik, University Hassan II, Casablanca, Morocco & Regional Center for the Professions of Education and Training (CRMEF), Casablanca-Settat, Morocco), Florentin Smarandache (University of New Mexico, USA), and Kavikumar Jacob (Faculty of Applied Sciences and Technology, Universiti Tun Hussein Onn Malaysia, Malaysia)
Copyright: © 2020 |Pages: 24
DOI: 10.4018/978-1-7998-1313-2.ch004
Abstract
A cycle passing through all the vertices exactly once in a graph is a Hamiltonian cycle (HC). In the field of network system, HC plays a vital role as it covers all the vertices in the system. If uncertainty exists on the vertices and edges, then that can be solved by considering fuzzy Hamiltonian cycle. Further, if indeterminacy also exist, then that issue can be dealt efficiently by having neutrosophic Hamiltonian cycle. In computer science applications, objects may not be a crisp one as it has uncertainty and indeterminacy in nature. Hence, new algorithms have been designed to find interval neutrosophic Hamiltonian cycle using adjacency matrix and the minimum degree of a vertex. This chapter also applied the proposed concept in a network system.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Chapter 10
Improvement of the Optimization of an Order Picking Model Associated With the Components of a Classic Volkswagen Beetle Using an Ant Colony Approach
Full Text Chapter Download: US $37.50 Add to Cart
Chapter 200
Social Network Analysis
To represent a network by representing which vertices of a graph are adjacent to which other vertices.
Published in Chapter: Social Network Analysis; From: Encyclopedia of Business Analytics and Optimization
Full Text Chapter Download: US $37.50 Add to Cart
Chapter 14
Key Factors in the Process of Acceptance and Implementation of Artificial Intelligence in the Hotel Sector
In this study, a square matrix that is used as a shape to represent cause-effect relationships based on the opinion of each of the experts. These relationships are quantified by values of the interval [-1,1].
Published in Chapter: Key Factors in the Process of Acceptance and Implementation of Artificial Intelligence in the Hotel Sector; From: Handbook of Research on Applied Data Science and Artificial Intelligence in Business and Industry
Full Text Chapter Download: US $37.50 Add to Cart
Chapter 208
A Survey of Link Analysis Ranking
A matrix that corresponts to a directed graph G=(V,E). Each element of an adjacency matrix A[i,j] has the value of 1 if there is a link from node i to node j and zero otherwise.
Published in Chapter: A Survey of Link Analysis Ranking; From: Encyclopedia of Networked and Virtual Organizations
Full Text Chapter Download: US $37.50 Add to Cart
Chapter 27
The Role of the Paper Packaging Industry in the Circular Economy: The Causal Relationship Analysis via Neutrosophic Cognitive Maps
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR