ABSTRACT: A graph that consists of t cliques sharing a vertex v is said to be a t-friendship graph with center v. A friendship graph is a graph that is t-friendship for some . We solve the problem of ...
We investigate the interplay between the graph isomorphism problem, logical definability, and structural graph theory on a rich family of dense graph classes: graph classes of bounded rank width. We ...
ABSTRACT: The eccentricity e(u) of a vertex u is the maximum distance of u to any other vertex of G. A vertex v is an eccentric vertex of vertex u if the distance from u to v is equal to e(u). The ...
This repository provides simple code snippets and implementations in Rust programming language for understanding various topics in discrete mathematics. The code examples and explanations are designed ...
This is the official repository for the paper "Diffusion Models for Graphs Benefit From Discrete State Spaces". Link to the paper: https://arxiv.org/abs/2210.01549 As ...
Department of Mathematics, Zhejiang Normal University, Zhejiang 321004, P. R. China Department of Basics, Zhejiang Guangsha Vocational and Technical, University of Construction, Zhejiang 322100, P. R.
Abstract: A vertex set D ⊆ V is considered a dominating set of G if every vertex in V − D is adjacent to at least one vertex in D. We called a dominating set D as a paired-dominating set if the ...
Elementary cellular automaton 77 and its reversible Fredkin version. In a nutshell, the main idea behind this course is that the development of the digital computer, together with the theory of ...
Abstract: The aim of this work is to develop low complexity receivers with close to optimum performance that circumvent high precision signal processing in the hardware. In particular, we consider ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results