JSTOR Daily

SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES

Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...
GitHub

Elements of Discrete Mathematics with Rust

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 ...
Scientific Research Publishing

T. Sousa. Friendship decompositions of graphs. Discrete Math., 308(15): 3352-3360, 2008. doi:10.1016/j.disc.2007.06.042

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 ...
Scientific Research Publishing

Friendship Decompositions of Graphs: The general problem ()

Departamento de Matem atica and Centro de Matem atica e Aplica c~oes Faculdade de Ci^encias e Tecnologia, Universidade Nova de Lisboa Quinta da Torre, 2829-516 Caparica, Portugal. A friendship graph ...
JSTOR Daily

Spectral conditions for graphs to be 𝛪𝛭-extendable or 𝑘-critical-bipartite

D. Fan, S. Goryainov, X. Huang, H. Lin, The spanning k-trees, perfect matchings and spectral radius of graphs, Linear Multilinear Algebra 70 (2022), 7264–7275. P ...
GitHub

Diffusion Models for Graphs Benefit From Discrete State Spaces

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

List 2-distance coloring of planar graphs without short cycles

Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R. China Xingzhi College, Zhejiang Normal University, Jinhua, Zhejiang 321004, P. R ...