Results 311 to 320 of about 1,239,128 (324)

Graph attention and Kolmogorov-Arnold network based smart grids intrusion detection. [PDF]

open access: yesSci Rep
Wu Y   +7 more
europepmc   +1 more source

The blict graph and blitact graph of a graph

Journal of Discrete Mathematical Sciences and Cryptography, 2001
Abstract In this paper, we introduce the concepts of the blict graph and blitact graph of a graph. We obtain some properties of these graphs. We present characterizations of graphs whose blict graphs and blitact graphs are planar, outerplanar, maximal outerplanar and minimally nonouterplanar.
M. S. Biradar, V. R. Kulli
openaire   +2 more sources

Conceptual Graphs Are Also Graphs

2014
The main objective of this paper is to add one more brick in building the CG model as a knowledge representation model autonomous from logic. The CG model is not only a graphical representation of logic, it is much more: it is a declarative model encoding knowledge in a mathematical theory, namely labelled graph theory, which has efficient computable ...
Chein, Michel, Mugnier, Marie-Laure
openaire   +3 more sources

Graph equations for line graphs, blitact graphs and blict graphs

Journal of Discrete Mathematical Sciences and Cryptography, 2005
Abstract In this paper, we solve the graph equations L(G)=B m (H), L(G) and . The equality symbol ‘=’ stands for an isomorphism between two graphs.
Veena Mathad, B. Basavanagoud
openaire   +2 more sources

Specifying Knowledge Graph with Data Graph, Information Graph, Knowledge Graph, and Wisdom Graph

International Journal of Software Innovation, 2018
Knowledge graphs have been widely adopted, in large part owing to their schema-less nature. It enables knowledge graphs to grow seamlessly and allows for new relationships and entities as needed. A knowledge graph is a graph constructed by representing each item, entity and user as nodes, and linking those nodes that interact with each other via edges.
Lixu Shao, Gongzhu Hu, Yucong Duan
openaire   +2 more sources

The graph of the chromial of a graph

1975
The chromial or chromatic polynomial of a finite graph G is a polynomial P(G,λ) in a variable λ with the following property: the value of P(G,λ) when λ is a positive integer is the number of ways of colouring G in λ colours. In this paper various properties of the chromial, considered as a function of a real variable λ, are discussed.
openaire   +2 more sources

Home - About - Disclaimer - Privacy