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 Simple Graph

Chapter 242
Encyclopedia of Business Analytics and Optimization
Undirected graph that has no loops (edges connected at both ends to the same vertex) and no more than one edge between any two different vertices.
Published in Chapter:
Weights and Multi-Edges in Link Prediction
Victor F. Cavalcante (IBM Research, Brazil) and Ana Paula Appel (IBM Research, Brazil)
Copyright: © 2014 |Pages: 10
DOI: 10.4018/978-1-4666-5202-6.ch242
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Chapter 1
Fundamentals of Graph for Graph Neural Network
An undirected graph without parallel edges or self-loops is called as simple graph.
Published in Chapter: Fundamentals of Graph for Graph Neural Network; From: Concepts and Techniques of Graph Neural Networks
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR