Results 301 to 310 of about 2,536,304 (342)

Rankings of graphs

SIAM Journal on Discrete Mathematics, 1995
Summary: A vertex (edge) coloring \(\phi:V\rightarrow \{1,2,\ldots,t\}\) (\(\phi':E\rightarrow \{1,2,\ldots, t\})\) of a graph \(G=(V,E)\) is a vertex (edge) \(t\)-ranking if, for any two vertices (edges) of the same color, every path between them contains a vertex (edge) of larger color. The vertex ranking number \(\chi_{r}(G)\) (edge ranking number \(
Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza   +6 more
openaire   +3 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   +1 more source

On the hamiltonian path graph of a graph

Journal of Graph Theory, 1987
AbstractThe hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and v are adjacent if and only if F contains a hamiltonian u − v path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian graphs isomorphic to their hamiltonian path ...
openaire   +3 more sources

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.
V. R. Kulli, M. S. Biradar
openaire   +1 more source

Specifying architecture of knowledge graph with data graph, information graph, knowledge graph and wisdom graph

2017 IEEE 15th International Conference on Software Engineering Research, Management and Applications (SERA), 2017
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. Knowledge graph has become a powerful tool to represent knowledge in the form of a labelled directed graph and to give semantics to textual information.
Yucong Duan, Lixu Shao, Gongzhu Hu, Zhangbing Zhou, Quan Zou 0001, Zhaoxin Lin   +5 more
openaire   +1 more source

G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering

Neural Information Processing Systems
Given a graph with textual attributes, we enable users to `chat with their graph': that is, to ask questions about the graph using a conversational interface.
Xiao-Xin He, Yijun Tian, Yifei Sun, N. Chawla, T. Laurent, Yann LeCun, Xavier Bresson, Bryan Hooi   +7 more
semanticscholar   +1 more source

Distributed Graphs and Graph Transformation

Applied Categorical Structures, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Graphs

Chest, 2006
Two rules of good graphs are presented and explicated.
openaire   +2 more sources

Complete Graphs and Bipartite Graphs in a Random Graph

2021 5th International Conference on Vision, Image and Signal Processing (ICVISP), 2021
Lijin Feng, Jackson Barr
openaire   +1 more source

Elimination graphs

ACM Transactions on Algorithms, 2009
In this article we study graphs with inductive neighborhood properties. Let P be a graph property, a graph G = ( V, E ) with n vertices is said to have an inductive neighborhood property with respect to P if there is an ...
Yuli Ye, Allan Borodin
openaire   +2 more sources