This is a preview. Log in through your library . Abstract This paper is mainly concerned with the realizability of a set of n integers as the degrees of vertices of an n-vertex linear graph. Other ...
This repository contains the implementation of a graph structure and algorithms in C, developed as part of my Advanced Data Structures class at Instituto Politécnico do Cávado e do Ave. The focus is ...
In graph theory, a dominating set for a graph $G$ is a subset $D$ of its vertices, such that any vertex of $G$ is in $D$, or has a neighbor in $D$. The minimum ...
Abstract: It has been witnessed that the learned data compression techniques has outperformed conventional ones. However, the non-deterministic floating-point calculation makes the probability ...
Bondy, J.A. and Murty, U.S.R. (1976) Graph Theory with Applications. Macmillan, London and Elsevier.
ABSTRACT: For a simple undirected graph G, let A( G ) be the (0, 1) adjacency matrix of G. The Seidel matrix of G, is defined as S( G )=J−I−2A( G ) , where J is the all-one matrix and I is the ...
ABSTRACT: For a simple undirected graph G, let A( G ) be the (0, 1) adjacency matrix of G. The Seidel matrix of G, is defined as S( G )=J−I−2A( G ) , where J is the all-one matrix and I is the ...
Abstract: Graph states are a particular class of entangled quantum states, that play essential roles in distributed quantum computing and quantum communication. In both cases, graph states are usually ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback