Results 101 to 110 of about 514 (184)

Distinguishing graphs by the number of homomorphisms

open access: yesDiscussiones Mathematicae Graph Theory, 1995
A homomorphism from one graph to another is a mapping that sends vertices to vertices and edges to edges. Let \(|G\to H|\) denote the number of homomorphisms from \(G\) to \(H\). For example \(|G\to K_n|\) is the number of \(n\)-colorings of \(G\). If \(\mathcal F\) is a collection of graphs, we say that \(\mathcal F\) distinguishes graphs \(G\) and ...
openaire   +1 more source

On t-intuitionistic fuzzy graphs: a comprehensive analysis and application in poverty reduction. [PDF]

open access: yesSci Rep, 2023
Razzaque A   +6 more
europepmc   +1 more source

When to Pre-Train Graph Neural Networks? From Data Generation Perspective! [PDF]

open access: yesKDD, 2023
Cao Y   +7 more
europepmc   +1 more source

Some Properties of the Plaquette Random-Cluster Model. [PDF]

open access: yesMath Phys Anal Geom
Duncan P, Schweinhart B.
europepmc   +1 more source

Interval Valued Intuitionistic Fuzzy Line Graphs. [PDF]

open access: yesBMC Res Notes, 2022
Repalle VNSR, Tola KA, Ashebo MA.
europepmc   +1 more source

Home - About - Disclaimer - Privacy