Results 71 to 80 of about 2,078,525 (187)
Between the enhanced power graph and the commuting graph [PDF]
arXiv, 2020 The purpose of this note is to define a graph whose vertex set is a finite group $G$, whose edge set is contained in that of the commuting graph of $G$ and contains the enhanced power graph of $G$. We call this graph the deep commuting graph of $G$. Two elements of $G$ are joined in the deep commuting graph if and only if their inverse images in every ...
arxiv
Inventions, 2020 Graph theory (GT) concepts are potentially applicable in the field of computer science (CS) for many purposes. The unique applications of GT in the CS field such as clustering of web documents, cryptography, and analyzing an algorithm’s execution ...
Abdul Majeed, Ibtisam Rauf
doaj +1 more source
Construction of cospectral graphs [PDF]
arXiv, 2018 Construction of non-isomorphic cospectral graphs is a nontrivial problem in spectral graph theory specially for large graphs. In this paper, we establish that graph theoretical partial transpose of a graph is a potential tool to create non-isomorphic cospectral graphs by considering a graph as a clustered graph.
arxiv
Discrete Mathematics, 1976 AbstractA unified approach to a variety of graph-theoretic problems is introduced. The k-closure Ck(G) of a simple graph G of order n is the graph obtained from G by recursively joining pairs of nonadjacent vertices with degree-sum at least k. It is shown that, for many properties P, one can find a suitable value of k (depending on P and n) such that ...
J. A. Bondy, Vašek Chvátal
openaire +2 more sources
Generalised Voltage Graphs [PDF]
arXiv, 2019 A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of graphs with a significant degree of symmetry.
arxiv
Knowledge graph analysis of particles in Japanese [PDF]
, 2005 The theory of knowledge graphs is a structuralistic theory of language. Its ontology consists of eight types of binary relationships and four types of so-called frames. The relationships connect so-called tokens, that represent semantic units.
Hoede, C.
core +1 more source
KOALA GRAPH THEORY INTERNET SERVICE
TASK Quarterly, 2015 KOALA has been created with the idea of C++ library templates, implementing a broad set of procedures in the fields of algorithmic graph theory and network problems in discrete optimization.
TOMASZ GOLUCH +2 more
doaj +1 more source
k-Colorability is Graph Automaton Recognizable [PDF]
, 2014 Automata operating on general graphs have been introduced by virtue of graphoids. In this paper we construct a graph automaton that recognizes $k$-colorable graphs.
arxiv +1 more source
Behavioural Neurology, 2012 The appropriate mathematical model for the problem space of tower transformation tasks is the state graph representing positions of discs or balls and their moves.
Andreas M. Hinz
doaj +1 more source
Open problems in the spectral theory of signed graphs [PDF]
arXiv, 2019 Signed graphs are graphs whose edges get a sign $+1$ or $-1$ (the signature). Signed graphs can be studied by means of graph matrices extended to signed graphs in a natural way. Recently, the spectra of signed graphs have attracted much attention from graph spectra specialists.
arxiv