This repository provides a comprehensive collection of lab exercises designed to supplement a standard undergraduate Discrete Mathematics course. The labs are available in both Python and Julia, ...

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 ...

An illustration of a magnifying glass. An illustration of a magnifying glass.

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 ...

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 ...