[KSIĄŻKA][B] Survey of planar and outerplanar graphs in fuzzy and neutrosophic graphs
T Fujita, F Smarandache - 2025 - books.google.com
As many readers may know, graph theory is a fundamental branch of mathematics that
explores networks made up of nodes and edges, focusing on their paths, structures, and …
explores networks made up of nodes and edges, focusing on their paths, structures, and …
Survey of intersection graphs, fuzzy graphs and neutrosophic graphs
T Fujita - … and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough …, 2024 - books.google.com
Graph theory is afundamental branch of mathematicsthat studiesnetworksconsisting of
nodes (vertices) and their connections (edges). Extensive research has been conducted on …
nodes (vertices) and their connections (edges). Extensive research has been conducted on …
Matrix estimation by universal singular value thresholding
S Chatterjee - 2015 - projecteuclid.org
Consider the problem of estimating the entries of a large matrix, when the observed entries
are noisy versions of a small random fraction of the original entries. This problem has …
are noisy versions of a small random fraction of the original entries. This problem has …
[KSIĄŻKA][B] Large networks and graph limits
L Lovász - 2012 - books.google.com
Recently, it became apparent that a large number of the most interesting structures and
phenomena of the world can be described by networks. To develop a mathematical theory of …
phenomena of the world can be described by networks. To develop a mathematical theory of …
Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing
We consider sequences of graphs (Gn) and define various notions of convergence related to
these sequences:“left convergence” defined in terms of the densities of homomorphisms …
these sequences:“left convergence” defined in terms of the densities of homomorphisms …
Estimating and understanding exponential random graph models
S Chatterjee, P Diaconis - The Annals of Statistics, 2013 - projecteuclid.org
We introduce a method for the theoretical analysis of exponential random graph models.
The method is based on a large-deviations approximation to the normalizing constant …
The method is based on a large-deviations approximation to the normalizing constant …
[PDF][PDF] Survey of trees, forests, and paths in fuzzy and neutrosophic graphs
T Fujita - 2024 - philarchive.org
In this paper, we conduct a comprehensive study of Trees, Forests, and Paths within the
framework of Fuzzy and Neutrosophic Graphs. Graph theory, known for its wide-ranging …
framework of Fuzzy and Neutrosophic Graphs. Graph theory, known for its wide-ranging …
Graph limits and exchangeable random graphs
P Diaconis, S Janson - arxiv preprint arxiv:0712.2749, 2007 - arxiv.org
We develop a clear connection between deFinetti's theorem for exchangeable arrays (work
of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and …
of Aldous--Hoover--Kallenberg) and the emerging area of graph limits (work of Lovasz and …
Random graphs with a given degree sequence
S Chatterjee, P Diaconis, A Sly - 2011 - projecteuclid.org
Large graphs are sometimes studied through their degree sequences (power law or regular
graphs). We study graphs that are uniformly chosen with a given degree sequence. Under …
graphs). We study graphs that are uniformly chosen with a given degree sequence. Under …
Flag algebras
AA Razborov - The Journal of Symbolic Logic, 2007 - cambridge.org
Asymptotic extremal combinatorics deals with questions that in the language of model theory
can be re-stated as follows. For finite models M, N of an universal theory without constants …
can be re-stated as follows. For finite models M, N of an universal theory without constants …