Results 321 to 330 of about 4,550,446 (348)

Spectral graph theory

Zeta and 𝐿-functions in Number Theory and Combinatorics, 2019
Spectral graph theory is a vast and expanding area of combinatorics. We start these notes by introducing and motivating classical matrices associated with a graph, and then show how to derive combinatorial properties of a graph from the eigenvalues of ...
Amol Sahebrao Hinge
semanticscholar   +1 more source

Graphs

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

A Bipartite Graph That Is Not the $��$-Graph of a Bipartite Graph

2020
For a graph $G = (V, E)$, the $ $-graph of $G$ is the graph whose vertex set is the collection of minimum dominating sets, or $ $-sets of $G$, and two $ $-sets are adjacent if they differ by a single vertex and the two different vertices are adjacent in $G$.
openaire   +1 more source

Cardinality of Hajós Graphs and Hajós Fuzzy Graphs on Fan Graph, Lollipop Graph, Friendship Graph, Tadpole Graph and Crown Graph

International Journal of Fuzzy Mathematical Archive
Hajos Fuzzy graph is a new fuzzy graph obtained by applying a binary operation, named Hajos construction, on two fuzzy graphs. The Hajos construction on two (fuzzy) graphs produces many different (fuzzy) graphs depending on the choice of vertices and edges.
K. Radha, A. Jasmine Kingsly
openaire   +1 more source

An algebra of graphs and graph rewriting

2005
In this paper we propose an axiomatization of ‘partially abstract graphs’, i.e., of suitable classes of monomorphisms in a category of graphs, which may be interpreted as graphs having both a concrete part and an abstract part (defined up to isomorphism). Morphisms between pa-graphs are pushout squares.
CORRADINI, ANDREA, MONTANARI, UGO GIOVANNI ERASMO   +1 more
openaire   +1 more source

Graph Decomposition of Slim Graphs

Graphs and Combinatorics, 1999
Let \(H\) be a fixed graph. An \(H\)-decomposition of an input graph \(G\) is a partition of the edge set of \(G\) such that each part forms a subgraph isomorphic to \(H\). This problem is known to be NP-complete as soon as \(H\) has a component with at least three edges. (This was conjectured by Holyer, and proved independently by \textit{D. Dor} and \
Caro, Yair, Yuster, Raphael
openaire   +2 more sources

Symmetric Graphs and Flag Graphs

Monatshefte f�r Mathematik, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Congruent Graphs and the Connectivity of Graphs

American Journal of Mathematics, 1932
We give here conditions that two graphs be congruent and some theorems on the connectivity of graphs, and we conclude with some applications to dual graphs. These last theorems might also be proved by topological methods. The definitions and results of a paper by the author on “Non-separable and planar graphs,” † will be made use of constantly.
openaire   +2 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.
B. Basavanagoud, Veena N. Mathad
openaire   +1 more source

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.
Yucong Duan, Lixu Shao, Gongzhu Hu
openaire   +1 more source