Graphs Limits Research Topics

Research Area/ Research Interest: Graphs Limits Math

Research Paper Topics for Masters and Ph.D. Thesis and publication

  1. Conformal growth rates and spectral geometry on distributional limits of graphs
  2. Failure detection and localization for timed event graphs in ( max , + ) -algebra
  3. Entrywise limit theorems of eigenvectors and their one-step refinement for sparse random graphs
  4. Item response theory approach in the preparation of instruments for identification of mathematics learning difficulties
  5. Diameters of graphs of reduced words and rank-two root subsystems
  6. Gaps labeling theorem for the bubble-diamond self-similar graphs
  7. Semigroups for flows on limits of graphs
  8. Continuum limits for adaptive network dynamics
  9.  Continuum limit of Lipschitz learning on graphs
  11. Bounds on the closeness centrality of a graph
  12. Uniform Convergence Rates for Lipschitz Learning on Graphs
  13. Counting Christmas Trees
  14. Semi-transitivity of directed split graphs generated by morphisms
  15. Community detection in graphs
  16. The Uniform Infinite Cubic Planar Graph
  17. Using the Higgs Combine Tool to Calculate Limits of the Cross Section of Doubly Charged Higgs Bosons
  18. A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
  19. Mean field limits of co-evolutionary heterogeneous networks
  20.  Wiener, edge-Wiener, and vertex-edge-
  21. Math operation embeddings for open-ended solution analysis and feedback
  22. Breaking of ensemble equivalence for dense random graphs under a single constraint
  23. Consistent nonparametric estimation for heavy-tailed sparse graphs
  24. Linear-sized independent sets in random cographs and increasing subsequences in separable permutations
  25. Reaction kinetic graphs of chain reactions: Solutions for their rate equations
  26. Nonuniform random graphs on the plane: A scaling study
  27. Homomorphism counts in robustly sparse graphs
  28. The fixed angle conjecture for QAOA on regular MaxCut graphs
  29. Harnack inequality and one-endedness of UST on reversible random graphs
  30. Reconstructing degree distribution and triangle counts from edge-sampled graphs
  31. Graphon mean field games and their equations
  32. Discrete-to-continuum limits of transport problems and gradient flows in the space of measures
  33. Strong couplings for static locally tree-like random graphs
  34. Generalized quantum-classical correspondence for random walks on graphs
  35.  Designing Tasks for Introducing Functions and Graphs within Dynamic Interactive Environments. Mathematics 2021, 9, 572
  36. t-SNE, forceful colorings, and mean field limits
  37. Mean-field limit of non-exchangeable systems
  38. The Limits of Local Search for Weighted k-Set Packing
  39. Regular Expressions and Math with Python
  40. The rigidity of infinite graphs II
  41. On an uncountable family of graphs whose spectrum is a Cantor set
  42. Inverse limits of upper semi-continuous functions, connectedness and the Cantor set
  43. Hausdorff limits of submanifolds of symplectic and contact manifolds
  44.  Data analysis software and graphs: Excel and R
  45. Designing and building enterprise knowledge graphs
  46.  First-Order Transductions of Graphs (Invited Talk)
  47.  Mathematics for computational science: lecture notes for MATH 156-OER project materials
  48. Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
  49. Sparse expanders have negative curvature
  50. Improved Combinatorial Approximation Algorithms for MAX CUT in Sparse Graphs
  51. Improved finite-time zeroing neural network for time-varying division
  52. The size-Ramsey number of cubic graphs
  53. Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model
  54. Poincar\’e inequality on minimal graphs over manifolds and applications
  55. Intrinsically Lipschitz graphs on semidirect products of groups
  56.  Spectral Theory of Graphons
  57. F1: A fast and programmable accelerator for fully homomorphic encryption
  58. Grover/Zeta Correspondence based on the Konno–Sato theorem
  59. Colouring graphs with no induced six-vertex path or diamond
  60. Double scaling limit for the O (N) 3-invariant tensor model
  61. Comparisons of Molecular Structure Generation Methods Based on Fragment Assemblies and Genetic Graphs
  62.  On singularity structure of minimax solution to Dirichlet problem for eikonal type equation with discontinuous curvature of boundary of boundary set
  63. Existence of solutions to a generalized self-dual Chern-Simons equation on graphs
  64. A graph theory approach to predicting functional failure propagation during conceptual systems design
  65. Global aspects of measure preserving equivalence relations and graphs
  66. Boundary driven Markov gas: duality and scaling limits
  67.  Learning future terrorist targets through temporal meta-graphs
  68. -operator limits on optical communication: Metaoptics, computation, and input-output transformations
  69. A probabilistic approach to the leader problem in random graphs
  70.  Flows on measurable spaces
  71. Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depth
  72. Random graph matching in geometric models: the case of complete graphs
  73. Analytical results for the distribution of first return times of random walks on random regular graphs
  74. Homology-changing percolation transitions on finite graphs
  75.  Graph Theory–A Survey on the Occasion of the Abel Prize for László Lovász
  76. Clustering Dynamics on Graphs: From Spectral Clustering to Mean Shift Through Fokker–Planck Interpolation
  77. Using Wikis to Support Student Inquiry in Large Math Classes.
  78. Convergence of combinatorial gravity
  79.  Advanced Common Core Math Explorations: Probability and Statistics (Grades 5-8)
  80. Motif-based mean-field approximation of interacting particles on clustered networks
  81. Limit theorems for exponential random graphs
  82. ShortWalk: an approach to network embedding on directed graphs
  83. On Local Distributions in Graph Signal Processing
  84. Topology of leaves for minimal laminations by non-simply-connected hyperbolic surfaces
  85. Critical exponents for a percolation model on transient graphs
  86. Type Graphs and Small-Set Expansion
  87. Closed neighborhood ideals of finite simple graphs
  88. The existence of extremal functions for discrete Sobolev inequalities on lattice graphs
  89. On Detour Index of Join of Graphs
  90. The feasible region of induced graphs
  91. Extremal values of the Sombor index in unicyclic and bicyclic graphs
  92. Distribution of money on connected graphs with multiple banks
  93. Update to limits to growth: Comparing the World3 model with empirical data
  94. Rank-k random graphs and finite type branching processes
  95. Mean-field limits for non-linear Hawkes processes with inhibition on a Erd\H {o} sR\'{e} nyi-graph
  96. Graph representation learning via simple jumping knowledge networks
  97. Precise modeling of PEM fuel cell using improved chaotic MayFly optimization algorithm
  98. The large deviation principle for interacting dynamical systems on random graphs
  99.  Teaching math in real time
  100. Limits of Short-Time Quantum Annealing
  101.  Rainbow coloring of some graphs
  102. Scattering resonances of large weakly open quantum graphs
  103. Fifth sustainable development goal gender equality in India: analysis by mathematics of uncertainty and covering of fuzzy graphs
  104. A family of tetravalent half-arc-transitive graphs
  105. Local and nonlocal complex discrete sine-Gordon equation. Solutions and continuum limits
  106. Theoretical and experimental study of the chatter vibration in wet and MQL machining conditions in turning process
  107. Randic index of bipolar fuzzy graphs and its application in network systems
  108. JetStream: Graph Analytics on Streaming Data with Event-Driven Hardware Accelerator
  109. Universality of spin correlations in the Ising model on isoradial graphs
  110. The rigidity of infinite graphs II
  111. Forecasting confirmed and recovered COVID-19 cases and deaths in Egypt after the genetic mutation of the virus: ARIMA Box-Jenkins approach
  112. Quantum Graphs with Vertices Violating the Time Reversal Symmetry
  113. Martingales and the characteristic functions of absorption time on bipartite graphs
  114. Partial-duals for planar ribbon graphs
  115. Applications of Continuous Combinatorics to Quasirandomness and Extremal Combinatorics
  116. A systematic review of student-mediated math interventions for students with emotional or behavior disorders
  117. Structure theory and stable rank for C*-algebras of finite higher-rank graphs
  118. Chromatic Bounds for the Subclasses of -Free Graphs
  119.  Interpolation method for solving weakly singular integral equations of the second kind
  120. Edge-based strict Lyapunov functions for consensus with connectivity preservation over directed graphs
  121. Strongly minimal Steiner Systems III: Path graphs and sparse configurations
  122.  Euler characteristic of graphs and networks
  124. Automatic analysis of attack graphs for risk mitigation and prioritization on large-scale and complex networks in Industry 4.0
  125. t-SNE, forceful colorings and mean field limits
  126. Semifinite harmonic functions on branching graphs
  127. Best match graphs with binary trees
  128. Barely supercritical percolation on Poissonian scale-free networks
  129. Weierstrass sets on finite graphs
  130. Adjacent vertex distinguishing edge coloring of IC-planar graphs
  131.  Scale-free geometric random graphs
  132.  SMART: A Situation Model for Algebra Story Problems via Attributed Grammar.
  133. Destroying multicolored paths and cycles in edge-colored graphs
  134. Application of Rothe’s method to a nonlinear wave equation on graphs
  135. Admissible Property of Graphs in Terms of Radius
  136. Positivity of Gibbs states on distance-regular graphs
  137. Minimal graphs of arbitrary codimension in Euclidean space with bounded 2-dilation
  138. A multidimensional examination of math anxiety and engagement on math achievement
  139. Wiener index of generalized odd complete graphs
  140.  Universality vs Genericity and C4-free graphs
  141. The Turán Numbers of Special Forests
  142. The Generalized Euler Characteristics of the Graphs Split at Vertices
  143. Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]-decorated containers
  144. Ordered Graph Limits and Their Applications
  145. Extension of threshold graphs under complex fuzzy environment
  146. Minimal hypersurfaces in manifolds of Ricci curvature bounded below
  147. Scaling limits and universality of Ising and dimer models
  148. Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy
  149. New benchmarks for learning on non-homophilous graphs
  150. Upper tail for homomorphism counts in constrained sparse random graphs
  151. Central Limit Theorems for global and local empirical measures of diffusions on Erd\H {o} sR\’enyi graphs
  152. Tuza’s conjecture for random graphs
  153.  Fluctuations of Subgraph Counts in Graphon Based Random Graphs
  154. Circular coloring of signed bipartite planar graphs
  155. Random Permutations–A geometric point of view
  156.  Deep Cognitive Reasoning Network for Multi-hop Question Answering over Knowledge Graphs
  157. Learning the Markov Order of Paths in Graphs
  158. Kernel Methods for Machine Learning with Math and R
  159. Exact-size Sampling of Enriched Trees in Linear Time
  160. Fuzzy topological structures via fuzzy graphs and their applications
  161. Scattering and Strebel graphs
  162. Mind Your Solver! On Adversarial Attack and Defense for Combinatorial Optimization
  163. On well-dominated direct, Cartesian and strong product graphs
  164. Distance degree vector and scalar sequences of corona and lexicographic products of graphs with applications to dynamic NMR and dynamics of nonrigid molecules …
  165. Spectra of elliptic operators on quantum graphs with small edges
  166. Sequential aggregation and rematerialization: Distributed full-batch training of graph neural networks on large graphs
  167. Advantages and limitations of quantum routing
  168.  Quality Assessment of Knowledge Graph Hierarchies using KG-BERT
  169. Homomorphism complexes, reconfiguration, and homotopy for directed graphs
  170. A Riemann-Roch Theorem on Infinite Graphs
  171. Tesseract: distributed, general graph pattern mining on evolving graphs
  172. Teseo and the analysis of structural dynamic graphs
  173. A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs
  174. Bipartite Ramsey Numbers of Cycles for Random Graphs
  175. Prospective mathematics teachers’ concept image on the limit of a function
  176. Trivalent vertex-transitive graphs with infinite vertex-stabilizers
  177. Critical Nodes in Graphon Mean Field Games
  178. Coopetition bunch graphs: competition and cooperation on COVID19 research
  179. The analytic evolution of Dyson–Schwinger equations via homomorphism densities
  180.  Estimating density limits for walking pedestrians keeping a safe interpersonal distancing
  181. Steiner Wiener index of Line graphs
  182. Maximum number of subtrees in cacti and block graphs
  183. Characterization of regular bipolar fuzzy graphs
  184. Parameterized complexity of defensive and offensive alliances in graphs
  185. Slit-strip Ising boundary conformal field theory 2: Scaling limits of fusion coefficients
  186. Octree-based point cloud simulation to assess the readiness of highway infrastructure for autonomous vehicles
  187. Typical large graphs with given edge and triangle densities
  188. Mwp-bert: A strong baseline for math word problems
  189. Extremal cubic graphs for fault-tolerant locating domination
  190. Density-functional theory on graphs
  191. A representation theorem for end spaces of infinite graphs
  192. Periodicity and Indecomposability in Generalized Inverse Limits
  193.  Fubini numbers and polynomials of graphs
  194. On the Randić incidence energy of graphs
  195. Entanglement of Free Fermions on Johnson Graphs
  196. Lovász:“Graphs and Geometry”. AMS, 2019, 444 pp
  197. The birth of geometry in exponential random graphs
  198.  Wireless wearable biosensor smart physiological monitoring system for risk avoidance and rescue
  199. Semi-relaxed Gromov Wasserstein divergence with applications on graphs
  200. Energy of interval-valued fuzzy graphs and its application in ecological systems
  201. Introducing fuzzy reactive graphs: a simple application on biology
  202.  Unions of chainable continua with the fixed point property
  203.  Implicit consensus clustering from multiple graphs
  204. Distributed processing of regular path queries in RDF graphs
  205. Classification of Quantum Graphs on and their Quantum Automorphism Groups
  206. KO codes: inventing nonlinear encoding and decoding for reliable wireless communication via deep-learning
  207. Online learning of time-varying signals and graphs
  208. The Complexities of Nonperturbative Computations
  209. On the characteristic polynomial and spectrum of Basilica Schreier graphs
  210. Resistance distance distribution in large sparse random graphs
  211. Approximating the cumulant generating function of triangles in the Erdös–Rényi random graph
  212. High-rate storage codes on triangle-free graphs
  213. Beyond the adjacency matrix: random line graphs and inference for networks with edge attributes
  214. C*-dynamical invariants and Toeplitz algebras of graphs
  215. Understanding over-squashing and bottlenecks on graphs via curvature
  216. Optimizing Differentially-Maintained Recursive Queries on Dynamic Graphs
  217. Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor
  218. Quantum evolution kernel: Machine learning on graphs with programmable arrays of qubits
  219.  Stability regions of systems with compatibilities, and ubiquitous measures on graphs
  220. Scalable Deep Gaussian Markov Random Fields for General Graphs
  221. Broadcast domination in graphs
  222. A survey of RDF stores & SPARQL engines for querying knowledge graphs
  223. Recolouring homomorphisms to triangle-free reflexive graphs
  224.  Toward an idiomatic framework for cognitive robotics
  225. Toughness for fractional (2, b, k)-critical covered graphs
  226. Existence and uniqueness of limits at infinity for homogeneous sobolev functions
  227.  Graph labelling in graph theory
  228. Double scaling limits of Dirac ensembles and Liouville quantum gravity
  229. Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters
  230. Moisture Fluctuations Modulate Abiotic and Biotic Limitations of H2 Soil Uptake
  231. Spectra of infinite graphs with summable weight functions
  232. Factor-of-iid balanced orientation of non-amenable graphs
  233. From one-way streets to percolation on random mixed graphs
  234. On sifted colimits in the presence of pullbacks
  235. A reconstruction method for graph signals based on the power spectral density estimation
  236. Double-threshold permutation graphs
  237. Extremal Graphs for Two Vertex-Disjoint Copies of a Clique
  238. Maker-Breaker games on randomly perturbed graphs
  239. Approximate solutions to the Travelling Salesperson Problem on semimetric graphs
  240. Hamiltonian problems in directed graphs with simple row patterns
  241. Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs
  242. Height function delocalisation on cubic planar graphs
  243. Threshold graphs under picture Dombi fuzzy information
  244. Matérn Gaussian processes on graphs
  245. Critical percolation on scale-free random graphs: New universality class for the configuration model
  246. A variant selection framework for genome graphs
  247. Learning hyperbolic attention-based embeddings for link prediction in knowledge graphs
  248. Learning to drop: Robust graph neural network via topological denoising
  249. On the Number of k-Matchings in Graphs
  250. Some families of integral mixed graphs
  251. Fundamental privacy limits in bipartite networks under active attacks
  252. Q-neutrosophic soft graphs in operations management and communication network
  253. New lower bound on the modularity of Johnson graphs
  254. Graphs, Principal Minors, and Eigenvalue Problems
  255. Finiteness of the percolation threshold for inhomogeneous long-range models in one dimension
  256. Random Walks on Graphs and Approximation of L2-Invariants
  257. Categorical data structures for technical computing
  258.  A new spectral invariant for quantum graphs
  259. On -saturated closed graphs
  260. Towards a characterization of convergent sequences of -line graphs
  261. Reading Tutors’ Interpretation of Curriculum-Based Measurement Graphs
  262. On Connected Graphs Having the Maximum Connective Eccentricity Index
  263.  The Limit Notion at Three Educational Levels in Three Countries
  264. The Brownian Map
  265. Optimal control problems driven by time-fractional diffusion equations on metric graphs: optimality system and finite difference approximation
  266. Push-Based Distributed Economic Dispatch in Smart Grids Over Time-Varying Unbalanced Directed Graphs
  267. Random cluster model on regular graphs
  268.  A theory of spectral partitions of metric graphs
  269. General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching
  270. Towards a characterization of convergent sequences of -line graphs
  271. Reading Tutors’ Interpretation of Curriculum-Based Measurement Graphs
  272. On Connected Graphs Having the Maximum Connective Eccentricity Index
  273.  The Limit Notion at Three Educational Levels in Three Countries
  274. The Brownian Map
  275. Optimal control problems driven by time-fractional diffusion equations on metric graphs: optimality system and finite difference approximation
  276. Push-Based Distributed Economic Dispatch in Smart Grids Over Time-Varying Unbalanced Directed Graphs
  277. Random cluster model on regular graphs
  278.  A theory of spectral partitions of metric graphs
  279. General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching
  280. Cutoff phenomenon of the Glauber dynamics for the Ising model on complete multipartite graphs in the high temperature regime
  281. Random walks on dense graphs and graphons
  282. Comparison of approximation algorithms for the travelling salesperson problem on semimetric graphs
  283. Non-planarity of Markoff graphs mod p
  284. Efficient node selection strategy for sampling bandlimited signals on graphs
  285. Inverse nodal problems on quantum tree graphs
  286. Efficient distributed approaches to core maintenance on large dynamic graphs
  287.  The RESET framework: examining critical factors in parent-child math participation
  288. Local minimizers in absence of ground states for the critical NLS energy on metric graphs
  289. From quantum speed limits to energy-efficient quantum gates
  290.  Homological Equivalence and Forman Equivalence of Discrete Morse Functions on Graphs
  291.  Do remedial activities using math workbooks improve student learning? Empirical evidence from scaled-up interventions in Niger
  292. Continuity of some non-local functionals with respect to a convergence of the underlying measures
  293. On finite prime distance graphs
  294. Robust Deep Reinforcement Learning Algorithm for VNF-FG Embedding
  295. Boundary Conditions Matter: On The Spectrum Of Infinite Quantum Graphs
  296.  A survey of line digraphs and generalizations
  297. Graphon convergence of random cographs
  298. DM-pruning CADJ graphs for SOM clustering
  299. On fast computations of numerical parameters of homogeneous algebraic graphs of large girth and small diameter and encryption of large files.
  300. Epidemic source detection in contact tracing networks: Epidemic centrality in graphs and message-passing algorithms
  301. Recent trends and challenges in predictive maintenance of aircraft’s engine and hydraulic system
  302. Self-paced learning-based multi-graphs semi-supervised learning
  303. Local algorithms for Maximum Cut and Minimum Bisection on locally treelike regular graphs of large degree
  304. Formalizing Hall’s Marriage Theorem in Lean
  305. Reduced order models from computed states of physical systems using non-local calculus on finite weighted graphs
  306. Community detection in spatial correlation graphs: Application to non-stationary ground motion modeling
  307. The Math of Tasks: A Domain Specific Language for Constraint-Based Task Specification
  308. Semilinear heat equations and parabolic variational inequalities on graphs
  309. Automorphic forms for PGL (3) over elliptic function fields. Part 1: Graphs of Hecke operators
  310. Analyzing spatial mobility patterns with time-varying graphical lasso: Application to COVID-19 spread
  311.  Upper bounds for Steklov eigenvalues of subgraphs of polynomial growth Cayley graphs
  312.  The Large Deviation Principle for Inhomogeneous Erdős–Rényi Random Graphs
  313. Scaling limits of random looptrees and bipartite plane maps with prescribed large faces
  314. Discovering and balancing fundamental cycles in large signed graphs
  315. On spectra and spectral measures of Schreier and Cayley graphs
  316. Defective Ramsey Numbers and Defective Cocolorings in Some Subclasses of Perfect Graphs
  317. On homomorphism graphs
  318. A study on some operations and products of neutrosophic hypersoft graphs
  319. Learning graphs from smooth and graph-stationary signals with hidden variables
  320. The generalized porous medium equation on graphs: existence and uniqueness of solutions with ℓ 1 data
  321. Size-Ramsey numbers of graphs with maximum degree three
  322. Harmonic analysis invariants for infinite graphs via operators and algorithms
  323.  Equivariant topology and derived algebra
  324. Engineered jumpers overcome biological limits via work multiplication
  325. Scaling and Selecting GPU Methods for All Pairs Shortest Paths (APSP) Computations
  326. Harary index of Eulerian graphs
  327. A proof of a conjecture on maximum Wiener index of oriented ladder graphs
  328.  Exact-size sampling of combinatorial structures in linear time
  329. Menger curve as inverse limit
  330. Uniform even subgraphs and graphical representations of Ising as factors of iid
  331. Numerical analysis of non-local calculus on finite weighted graphs, with application to reduced-order modelling of dynamical systems
  332. Degrees in link graphs of regular graphs
  333. Symmetry and the entropy of small-world structures and graphs
  334.  Chemical distance in geometric random graphs with long edges and scale-free degree distribution
  335.  Improvement of Basic Math Skills Through Realistic Mathematics Education (RME) in Early Childhood
  336.  Dynamics of epidemic spreading on connected graphs
  337. Unsupervised clustering on signed graphs with unknown number of clusters
  338. Parallel network simplex algorithm for the minimum cost flow problem
  339.  Model-Theoretic Limits and the Hrushovski Construction
  340. Aligning random graphs with a sub-tree similarity message-passing algorithm
  341. Adaptive Hagen–Poiseuille flows on graphs
  342. Understanding Calculus: Tying Loose Ends Together
  343. SARS-CoV-2 superspreading in cities vs the countryside
  344. Group-annihilator graphs realised by finite abelian groups and its properties
  345. Zero-sum copies of spanning forests in zero-sum complete graphs
  346. Possibility degree-based interval-valued q-rung orthopair fuzzy graphs
  347. Emergence of extended states at zero in the spectrum of sparse random graphs
  348. Numerical simulations on nonlinear quantum graphs with the GraFiDi library
  349. Loop-erased partitioning of cycle-free graphs
  350. Percolation in Random Graphs of Unbounded Rank
  351. Cospectral generalized Johnson and Grassmann graphs
  352. Insuring large stakes: A normative and descriptive analysis of households’ flood insurance coverage
  353. Structure and estimation of network models with overlapping communities
  354. Random graphs with node and block effects: models, goodness-of-fit tests, and applications to biological networks
  355. The occurrence of locally riddled basins and on-off intermittency in a parametric nonlinear system
  356.  Visualizing large-scale high-dimensional data via hierarchical embedding of KNN graphs
  357. Errett Bishop theorems on Complex Analytic Sets: Chow’s Theorem Revisited and Foliations with all leaves Compact on K\” ahler Manifolds
  358. Sumsets of semiconvex sets
  359. Continuous functions with impermeable graphs
  360. On the depth of binomial edge ideals of graphs
  361. On the maxima of motzkin-straus programs and cliques of graphs
  362. Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
  363. Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs
  364. Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
  365. Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms
  366. Toward a multilevel scalable parallel Zielonka’s algorithm for solving parity games
  367. Rate-Distortion Optimized Graph Coarsening and Partitioning for Light Field Coding
  368. Effectiveness of teaching and learning in technology-supported mathematics education
  369. Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold
  370. Scratch-RL: A preference-driven adversarial reinforcement reasoning framework over knowledge graphs for explainable recommendation of Scratch
  371.  Graph codes-2d projections of multimedia feature graphs for fast and effective retrieval
  372. The Ising antiferromagnet and max cut on random regular graphs
  373. Competition graphs under interval-valued m-polar fuzzy environment and its application
  374. Groups of proper homotopy equivalences of graphs and Nielsen Realization
  375. Minimum spanning trees of random geometric graphs with location dependent weights
  376. Anisotropic mean curvature flow of Lipschitz graphs and convergence to self-similar solutions
  377.  Fibonacci numbers in graphs with strong (1, 1, 2)-kernels
  378. Regular graphs with many triangles are structured
  379. Roman Domination and Double Roman Domination Numbers of Sierpiński Graphs S ( K n , t )
  380. More about sparse halves in triangle-free graphs
  381. Parallel graph coloring algorithms for distributed GPU environments
  382. On properties of pebble assignment graphs
  383.  Factor of iid schreier decoration of transitive graphs
  384. Classical algorithms and quantum limitations for maximum cut on high-girth graphs
  385. Close-to-zero eigenvalues of the rooted product of graphs
  386. The profinite completion of the fundamental group of infinite graphs of groups
  387. Detecting high-scoring local alignments in pangenome graphs
  388. AutoMeKin2021: An open-source program for automated reaction discovery
  389. Homomorphism Tensors and Linear Equations
  390. The Cheeger Cut and Cheeger Problem in Metric Graphs
  391. Powers of graphs & applications to resolutions of powers of monomial ideals
  392. Limits and convergence properties of the sequentially Markovian coalescent
  393. The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
  394. Are there limits to diversification in emerging economies? Distinguishing between firm-level and business group strategies
  395. Language-focused interventions on math performance for English learners: A selective meta-analysis of the literature
  396. Random cubic planar graphs converge to the Brownian sphere
  397. Eigenvalues of Stochastic Blockmodel Graphs and Random Graphs with Low-Rank Edge Probability Matrices
  398. GRAPHOPT: constrained-optimization-based parallelization of irregular graphs
  399. Remote teaching of publication-quality, single-case graphs in Microsoft Excel
  400. Isomorphisms between random graphs
  401. Butterfly counting on uncertain bipartite graphs
  402. Detecting Cross-Language Plagiarism using Open Knowledge Graphs
  403. Topological graphs and singly generated dynamical systems
  404. Algorithms based on path contraction carrying weights for enumerating subtrees of tricyclic graphs
  405. Clan embeddings into trees, and low treewidth graphs
  406. Closed relations with non-zero entropy that generate no periodic points
  407. Bifurcations in Nagumo Equations on Graphs and Fiedler Vectors
  408. Non-bipartite k-common graphs
  409. On Generalized Turán Number of Two Disjoint Cliques
  410. A SAT approach to twin-width
  411. Criterion analysis and experimental study of combustion mechanisms in a bidirectional swirling flow and their relationship with pollutants emission
  412. Time optimal trajectories for a mobile robot with acceleration and speed limits in the presence of an obstacle
  413. ORCA: Outlier detection and Robust Clustering for Attributed graphs
  414. Exact modularity of line graphs of complete graphs
  415. Nonoverlapping Domain Decomposition in Space and Time for Optimal Control Problems on Metric Graphs by the Example of Gas Flow in Pipe Networks
  416. Ratio limits and Martin boundary
  417. An exact method for the minimum feedback arc set problem
  418. Gap sets for the spectra of cubic graphs
  419. Prediction of forming limits and microstructural evolution during warm stretch forming of DP590 steel
  420. Tardigrade Survival Limits in High-Speed Impacts—Implications for Panspermia and Collection of Samples from Plumes Emitted by Ice Worlds
  421. Algebraic properties of edge ideals of some vertex-weighted oriented m-partite graphs
  422.  Efficient one asset replacement scheme for an optimized portfolio
  423. Initial degenerations of flag varieties
  424.  Spectral classes of hypergraphs.
  425.  Decreasing property and complete monotonicity of two functions constituted via three derivatives of a function involving trigamma function
  426. Reasoning in Knowledge Graphs
  427. Semantic Web: Graphs, Imprecision and Knowledge Generation
  428.  Even factors in edge-chromatic-critical graphs with a small number of divalent vertices
  429. Orienting (hyper) graphs under explorable stochastic uncertainty
  430.  Necessary and sufficient conditions for a difference defined by four derivatives of a function containing trigamma function to be completely monotonic
  431.  C5 is almost a fractalizer
  432. Overview of STEM Science as Process, Method, Material, and Data Named Entities
  433. Simplifying Node Classification on Heterophilous Graphs with Compatible Label Propagation
  434. A system dynamics model for the impact of capacity limits on the bullwhip effect (bwe) in a closed-loop system with remanufacturing
  435.  Estimating Descriptors for Large Graphs
  436. Integral Calculus
  437. Predictable topological sensitivity of Turing patterns on graphs
  438.  On the normalized Laplacian spectra of random geometric graphs
  439. Non-monotone cellular automata: Order prevails over chaos
  440. The effect of vertex and edge deletion on the edge metric dimension of graphs
  441. OOD Link Prediction Generalization Capabilities of Message-Passing GNNs in Larger Test Graphs
  442. Directional graph networks
  443. Matching numbers in fuzzy graphs
  444. Classifying Calabi–Yau Threefolds Using Infinite Distance Limits
  445. Intraseasonal predictability of natural phytoplankton population dynamics
  446.  Combinatorics and algorithms for quasi-chain graphs
  447. Oddomorphisms and homomorphism indistinguishability over graphs of bounded degree
  448.  Playing Games with Ais: The Limits of GPT-3 and Similar Large Language Models
  449. A New Algorithm for Embedding Plane Graphs at Fixed Vertex Locations
  450. Shortest paths in graphs of convex sets
  451. A modified sine cosine algorithm with ensemble search agent updating schemes for small signal stability analysis
  452. Constructing knots with specified geometric limits
  453. From (secure) w-domination in graphs to protection of lexicographic product graphs
  454. Large deviation Local Limit Theorems and limits of biconditioned Trees and Maps
  455. The Limits of Partisan Gerrymandering
  456. Exact square coloring of subcubic planar graphs
  457. Facial Visibility in Edge Colored Plane Graphs
  458. Three-halves variation of geodesics in the directed landscape
  459. Evaluating effects of background stories on graph perception
  460. Stochastic Design of Flood Control Systems; Uncertainty Propagation and Results Representation
  461. Zero-divisor super- λ graphs
  462. Coarse Geometry of Pure Mapping Class Groups of Infinite Graphs
  463.  Standing waves on quantum graphs
  464. p-Adic Wave Equations on Finite Graphs and T0-Spaces
  465. Implementing the precautionary approach into fisheries management: Biomass reference points and uncertainty buffers
  466. Graph limits: An alternative approach to s-graphons
  467. Network Robustness Analysis for IoT Networks using Regular Graphs
  468. is almost a fractalizer
  469.  Obey validity limits of data-driven models through topological data analysis and one-class classification
  470.  Characterizing attitudinal network graphs through frustration cloud
  471. Weisfeiler and Lehman go cellular: CW networks
  472. Efficient structural node similarity computation on billion-scale graphs
  473. Transport efficiency of continuous-time quantum walks on graphs
  474.  Measurement of the Responses of Cloud-based Game Streaming to Network Congestion
  475. Geometry of Random Cayley Graphs of Abelian Groups
  476. Minimum spanning tree-based cluster analysis: A new algorithm for determining inconsistent edges
  477. Explicit connections between supersingular isogeny graphs and Bruhat–Tits trees
  478.  Biharmonic classification of infinite graphs: Bi-networks and Poisson networks
  479. Arc-completion of 2-colored best match graphs to binary-explainable best match graphs
  480. Representation Learning on Spatial Networks
  481. Leveraging Topological Events in Tracking Graphs for Understanding Particle Diffusion
  482. Vlasov equations on digraph measures
  483. Analyzing developer contributions using artifact traceability graphs
  484. On cd-Coloring of -free Chordal Graphs
  485. Relative graphs and pullbacks of relative Toeplitz graph algebras
  486. Hamilton-connectivity of line graphs with application to their detour index
  487. Decorated stable trees
  488. Confidence Threshold Neural Diving
  489. Scip-jack: An exact high performance solver for steiner tree problems in graphs and related problems
  490.  Numerical Methods for Scientific Computing: The Definitive Manual for Math Geeks
  491. Extended abstract dependency graphs
  492. A continuum limit for the PageRank algorithm
  493. Genus of graphs under picture fuzzy environment with applications
  494. Partial identification of the distribution of treatment effects with an application to the Knowledge is Power Program (KIPP)
  495. Metric dimension related parameters in graphs: A survey on combinatorial, computational and applied results
  496. Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures
  497. The upper tail problem for induced 4-cycles in sparse random graphs
  498. Characterizing Performance Limits in Payment Channel Networks
  499. Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO4) n− tetrahedra
  500. On the Euclidian Metric for Undirected Graphs and Exact Calculations
  501. Limits of Jensen polynomials for partitions and other sequences
  502. Asymptotic analysis of diabatic surface hopping algorithm in the adiabatic and non-adiabatic limits
  503.  Fractional mean curvature flow of Lipschitz graphs
  504. SWFC-ART: A cost-effective approach for Fixed-Size-Candidate-Set Adaptive Random Testing through small world graphs
  505. Spectral measures and dominant vertices in graphs of bounded degree
  506. Spectra of adjacency and Laplacian matrices of inhomogeneous Erdős–Rényi random graphs
  507. Random simplicial complexes: models and phenomena
  508. The Q-generating Function for Graphs with Application
  509. Holes in lace doilies: The geometric kernel of circulant graphs
  510. Homogenisation of dynamical optimal transport on periodic graphs
  511.  Spectral analysis of transient amplifiers for death–birth updating constructed from regular graphs
  512. Limits for scattering resonances in azimuthally inhomogeneous nanotubes
  513.  Studying formability limits by combining conventional and incremental sheet forming process
  514. Scaling limits in algebra, geometry, and probability
  515. The m-Bézout bound and distance geometry
  516. Some aspects of zero-divisor graphs for the ring of Gaussian integers modulo 2 n
  517. On cd-coloring of trees and co-bipartite graphs
  518. Entropy of labeled versus unlabeled networks
  520. Typicality and entropy of processes on infinite trees
  521. Characterizations of ITBM-computability. I
  522. Is math useful?
  523. Uncountably many minimal hereditary classes of graphs of unbounded clique-width
  524. Categories of graphs for operadic structures
  525. Finding Geometric Representations of Apex Graphs is NP-Hard
  526. Shotgun assembly of unlabeled erdos-renyi graphs
  527. Neighbors degree sum energy of graphs
  528. Recent progress on graphs with fixed smallest adjacency eigenvalue: A survey
  529. Posterior consistency of semi-supervised regression on graphs
  530. Disjointness graphs of segments in the space
  531. Building Graphs at Scale via Sequence of Edges: Model and Generation Algorithms
  532. Scaling Limits of Random Walks, Harmonic Profiles, and Stationary Non-Equilibrium States in Lipschitz Domains
  533. The autodidactic universe
  534. Algebraic Properties of Edge Ideals and Cover Ideals of Unbalanced Crown Graphs
  535. Number of edges in inhomogeneous random graphs
  536. Diffusive limit of random walks on tessellations via generalized gradient flows
  537.  Gender by racial/ethnic intersectionality in the patterns of Adolescents’ math motivation and their math achievement and engagement
  538. On the difference of Mostar index and irregularity of graphs
  539. Recoloring Unit Interval Graphs with Logarithmic Recourse Budget
  540. Physician-Modified Stent-Grafts Created in the Three-Dimensionally Aortic Template Have Better Reliability and Greater Alignment With the Target Vessels Than Stent …
  541.  A multi-objective approach for PH-graphs with applications to stochastic shortest paths
  542. Location of maximum degree vertices in weighted recursive graphs with bounded random weights
  543. The impact of words in mathematics education–Case of‎ symbols
  544. Upper tail of the spectral radius of sparse Erd\H {o} sR\'{e} nyi graphs
  545. Moduli of hybrid curves II: Tropical and hybrid Laplacians
  546. Transferrable Framework Based on Knowledge Graphs for Generating Explainable Results in Domain-Specific, Intelligent Information Retrieval
  547. Fast T2-Weighted Imaging With Deep Learning-Based Reconstruction: Evaluation of Image Quality and Diagnostic Performance in Patients Undergoing Radical …
  548. Pseudo-Poincar\’e: A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks
  549.  Characterizations of indecomposable subcontinua of graph-like continua
  550. Classification of local problems on paths from the perspective of descriptive combinatorics
  551. GHWs of Codes Arising from Cartesian Product of Graphs
  552. On the Nonexistence of Distance-Regular Graphs with Intersection Array
  553. New bounds for Ramsey numbers R (Kk− e, Kl− e)
  554. Cycle saturation in random graphs
  555. Gabor-type frames for signal processing on graphs
  556. Percolation and loop model
  557. Bakry-Émery curvature on graphs as an eigenvalue problem
  558. On the watching number of graphs using discharging procedure
  559. Computing graph descriptors on edge streams
  560. On the connectivity and giant component size of random k-out graphs under randomly deleted nodes
  561. A Study of ICT-Based Learning in Elementary School Mathematics Learning Concepts During the COVID-19 Pandemic
  562. Embedding K3, 3 and K5 on the Double Torus
  563.  Implementation of digital technologies into pre-service mathematics teacher preparation
  564. Graphs of groups with totally disconnected Morse boundary
  565. On Supereulerian 2-Edge-Coloured Graphs
  566. Leavitt path algebras of weighted Cayley graphs $$\varvec {C_n (S, w)} $$ C n (S, w)
  567. Scattering diagrams from asymptotic analysis on Maurer–Cartan equations
  568.  Assignment flows for data labeling on graphs: convergence and stability
  569. Graphon signal processing
  570. Locality of Random Digraphs on Expanders
  571. Constrained colourings of random graphs
  572. Convergence of trees with a given degree sequence and of their associated laminations
  573.  A note on different types of product of neutrosophic graphs
  574. Practical graph signal sampling with log-linear size scaling
  575. Regularity for graphs with bounded anisotropic mean curvature
  576. Compartment modelling and eigenvalue expansion to study the drug concentration in capillary and tissue regions surrounding the malignant tumour
  577. Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
  578. A General Model to Calculate the Spin–Lattice Relaxation Rate (R1) of Blood, Accounting for Hematocrit, Oxygen Saturation, Oxygen Partial Pressure, and Magnetic …
  579. Ollivier-Ricci curvature convergence in random geometric graphs
  580. Beck’s Coloring of Finite Product of Commutative Ring with Unity
  581. FPGA-based HPC accelerators: An evaluation on performance and energy efficiency
  582. Balanced districting on grid graphs with provable compactness and contiguity
  583. Two Disjoint Alternating Paths in Bipartite Graphs
  584. A min-max regret approach for the Steiner Tree Problem with Interval Costs
  585.  Fixation Maximization in the Positional Moran Process
  586. Graphgt: Machine learning datasets for graph generation and transformation
  587. A discriminative method for global query expansion and term reweighting using co-occurrence graphs
  588. Motif estimation via subgraph sampling: The fourth-moment phenomenon
  589. Line Graph Links
  590.  Interval-expressed tree-like continua with the fixed point property
  591. Train track maps and CTs on graphs of groups
  592. Graphon Filters: Signal Processing in Very Large Graphs
  593. Sparse random graphs with many triangles
  594.  WLAN-log-based superspreader detection in the COVID-19 pandemic
  595. Wegner’s Conjecture on 2-Distance Coloring
  596. An APOS analysis of student’s understanding of quadratic function graph
  597. Energy of bipolar fuzzy graphs
  598. Saved to My library
  599.  Multiplicity of positive solutions to semi-linear elliptic problems on metric graphs
  600. Teichmüller theory and the Thurston metric For any surface S with χ (S)< 0, Teichmüller space, T (S) is the space of all hyperbolic structures on S up to …
  601. Hardness of metric dimension in graphs of constant treewidth
  602. SelfKG: Self-Supervised Entity Alignment in Knowledge Graphs
  603. An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
  604. On partial descriptions of König graphs for odd paths and all their spanning supergraphs
  605. Evaluating deep graph neural networks
  606. Flash sintering produces eutectic microstructures in Al2O3–LaPO4 versus conventional microstructures in 8YSZ–LaPO4
  607. Designing Sparse Graphs for Stochastic Matching with an Application to Middle-Mile Transportation Management
  608. Circuit quantum electrodynamics in hyperbolic space: From photon bound states to frustrated spin models
  609. Eikonal depth: an optimal control approach to statistical depths
  610. Quantum walk-based search algorithms with multiple marked vertices
  611. Large independent sets in Markov random graphs
  612. Programming in Mathematics Education: An Intermediary between the Real-World and the Mathematical Model
  613. Distance-two colourings of Barnette graphs
  614. Uniform local amenability implies Property A
  615. A refinement sequence of Partial loop erasure
  616. Dominant Local Metric Dimension of Wheel Related Graphs
  617. Grasping Derivatives: Teaching Mathematics through Embodied Interactions using Tablets and Virtual Reality
  618.  Fast cluster-based computation of exact betweenness centrality in large graphs
  619. Hidden symmetries in non-self-adjoint graphs
  620. Directed polymers on infinite graphs
  621.  Clustering sequence graphs
  622. Cognitive and behavioral risk factors for low quality of life in survivors of childhood acute lymphoblastic leukemia
  623. A Subgraph Isomorphism-based Attack Towards Social Networks
  624. Semidirect product rigidity of group von Neumann algebras arising from class , inductive limits and fundamental group
  625. Deep Learning and Mathematical Intuition: A Review of (Davies et al. 2021)
  626.  Algorithms and Complexity on Indexing Founder Graphs
  627. Do more school resources increase learning outcomes? evidence from an extended school-day reform
  628. A full characterization of invariant embeddability of unimodular planar graphs
  629. Analytical and Computational Study of Multi-temperature Kinetic Ising Models on Various Graphs (thesis)
  630. Casting graph isomorphism as a point set registration problem using a simplex embedding and sampling
  631. Infinite towers in the graphs of many dynamical systems
  632. Exponential growth constants for spanning forests on Archimedean lattices: Values and comparisons of upper bounds
  633. An investigation on m-polar fuzzy threshold graph and its application on resource power controlling system
  634. IOL formula constants: strategies for optimization and defining standards for presenting data
  635.  Is the Mathematics Diagnostic Test a Good Predictor of College Students’ Prior Knowledge in Math?.
  636. Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs
  637. Counting Hamiltonian cycles in 2-tiled graphs
  638. Spectrum of periodic chain graphs with time-reversal non-invariant vertex coupling
  639. Case-Based Learning and Reasoning Using Layered Boundary Multigraphs
  640. Compact Exponential Conservative Approaches for the Schrödinger Equation in the Semiclassical Regimes
  641. Decimation limits of principal algebraic -actions
  642.  An Invitation to Pursuit-Evasion Games and Graph Theory
  643. Topological limits to the parallel processing capability of network architectures
  644. Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
  645.  VRP in urban areas to optimize costs while mitigating environmental impact
  646. The H-property of Line Graphons
  647. A note on dominating pair degree condition for hamiltonian cycles in balanced bipartite digraphs
  648.  Numerical simulations on nonlinear quantum graphs with the GraFiDi library
  649. The multi-robber damage number of a graph
  650. Temporal knowledge graph completion: A survey
  651. Sharp Bounds on the Permanental Sum of a Graph
  652. Fine properties of branch point singularities: stationary two-valued graphs and stable minimal hypersurfaces near points of density
  653.  Tales from three countries: reflections during COVID-19 for mathematical education in the future
  654.  Stationary diffusion state neural estimation for multiview clustering
  655. From Colourful to Rainbow Paths in Graphs: Colouring the Vertices
  656. Local convergence of random planar graphs
  657. Urbanization and COVID-19 incidence: A cross-country investigation
  658.  Effect of inclined magnetic field on flow, heat and mass transfer of Williamson nanofluid over a stretching sheet
  659. Inducibility and universality for trees
  660. A new model to analyze the temperature effect on the microalgae performance at large scale raceway reactors
  661.  Realized Random Graphs, with an Application to the Interbank Network
  662.  Nonlocal-interaction equation on graphs: gradient flow structure and continuum limit
  663. The constitution of mathematical knowledge with augmented reality
  664. Co-linear Chaining on Graphs With Cycles
  665. Fish catch management strategies: Evaluating the interplay between body size and global warming
  666. Ballistic impact performance of composite laminates based on high-density polyethylene/montmorillonite nanocomposite and Aramide fiber
  667. Stochastic completeness of graphs: bounded Laplacians, intrinsic metrics, volume growth and curvature
  668.  Computational Thinking: How computers think, decide and learn, when human limits start and computers champ. Vol. 1
  669. Decentralized resource allocation for interdependent infrastructures resilience: a cooperative game approach
  670. Dimension-free bounds and structural results in communication complexity
  671. Ground metric learning on graphs
  672. Practical graph signal sampling with log-linear size scaling
  674. Equation of state of hydrogen, helium, and solar plasmas
  675. Investigating the Chinese postman problem on a quantum annealer
  676. The Grassmannian of 3-planes in is sch\”on
  677. Affect graphing: leveraging graphical representations in the study of students’ affect in mathematics
  678. Minimal detectable change of the disc-fovea angle for ocular torsion assessment
  679.  n-laplacians on metric graphs and almost periodic functions: I
  680. Weak-disorder limit at criticality for directed polymers on hierarchical graphs
  681.  Partitioning Geometric Graphs into Plane Subgraphs
  682. Lucas graphs
  683. Statistics and gap distributions in random Kakutani partitions and multiscale substitution tilings
  684. Brill-Lindquist-Riemann sums and their limits
  685. New upper bounds for the number of embeddings of minimally rigid graphs
  686. Markov processes on quasi-random graphs
  687. Iterated Foldings of Discrete Spaces and Their Limits: Candidates for the Role of Brownian Map in Higher Cimensions
  688.  Asymptotics and estimates for spectral minimal partitions of metric graphs
  689. GRAPHYP: A Scientific Knowledge Graph with Manifold Subnetworks of Communities. Detection of Scholarly Disputes in Adversarial Information Routes
  690. Operadic modeling of dynamical systems: mathematics and computation
  691. Towards Empowering Data Lakes with Knowledge Graphs
  692. On the H-Property for Step-Graphons and Edge Polytopes
  693. Cyclic deformation behavior of Mg–SiC nanocomposites on the macroscale and nanoscale
  694. Diameter search algorithms for directed Cayley graphs
  695.  A novel formulation of the fuzzy hybrid transform for dealing nonlinear partial differential equations via fuzzy fractional derivative involving general order
  696.  New epistemological perspectives on quantitative methods: An example using Topological Data Analysis
  697. Template-Driven Rainbow Coloring of Proper Interval Graphs
  698. Topological indices for the iterations of Sierpiński rhombus and Koch snowflake
  699. Limits and fluctuations of p-adic random matrix products
  700. A finitary structure theorem for vertex-transitive graphs of polynomial growth
  701. Multifractal characterisation of particulate matter (PM10) time series in the Caribbean basin using visibility graphs
  702. Embedding Quality in Extrusion-Based Additive Manufacturing Technologies
  703.  OONIS—Object-oriented network infection simulator
  704. A multi-objective approach for the optimal design of a standalone hybrid renewable energy system
  706. Quantization of Kähler manifolds
  707. Issue engagement across members of parliament: the role of issue specialization and party leadership
  708.  Bird’s Basic Engineering Mathematics
  709. Covering problem on fuzzy graphs and its application in disaster management system
  710. Topic diversity: A discipline scheme-free diversity measurement for journals
  711. Chimeras unfolded
  712. Transferability of graph neural networks: an extended graphon approach
  713. Random normal matrices in the almost-circular regime
  714. A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems
  715. Vertebrate population trends are influenced by interactions between land use, climatic position, habitat loss and climate change
  716. Analyzing the connectedness between crude oil and petroleum products: Evidence from USA
  717. Inferring dependency graphs for agent-based models using aspect-oriented programming
  718. Lower bounds on the chromatic number of random graphs
  719. Approximation of Feasible Power Injection Regions in Distribution Networks via Dual SOCP
  720.  Design of a 4 bit Arithmetic and Logical unit with Low Power and High Speed
  721. An alternating direction method of multipliers-based approach to solve mixed-integer nonlinear volt/var optimization problems in distribution systems
  722. AORM: Fast Incremental Arbitrary-Order Reachability Matrix Computation for Massive Graphs
  723. Reinforcement Learning with Real Valued Tangled Program Graphs
  724. Degree conditions forcing directed cycles
  725.  A new multi-level algorithm for balanced partition problem on large scale directed graphs
  726. Sharp threshold for alignment of graph databases with Gaussian weights
  727.  A cross-platform OpenVX library for FPGA accelerators
  728.  Machine learning based energy-free structure predictions of molecules, transition states, and solids
  729. Triangulations of uniform subquadratic growth are quasi-trees
  730.  Exchange-based diffusion in Hb-Graphs
  731. The Limits of Law and AI
  732. Minimum coloring problems with weakly perfect graphs
  733. The Random Plots Graph Generation Model for Studying Systems with Unknown Connection Structures
  734. Tensions and synergies in arts-integrated data literacy instruction: Reflections on four classroom implementations
  735. Evolution of rift systems and their fault networks in response to surface processes
  738. Limiting distributions of graph-based test statistics
  739.  Understanding Physics Using Mathematical Reasoning
  740.  Fluctuations of extreme eigenvalues of sparse Erdős–Rényi graphs
  741. Electrical and gas networks coupling through hydrogen blending under increasing distributed photovoltaic generation
  743.  Plenty of big projections imply big pieces of Lipschitz graphs
  744. Designs in finite metric spaces: a probabilistic approach
  745. Relationships between semiotic representational transformations and performance outcomes in digital math games
  746. Optimal resistor networks
  747. Structural design of reinforced concrete buildings based on deep neural networks
  748. Quantum approximate optimization of non-planar graph problems on a planar superconducting processor
  749.  Towards intelligent compiler optimization
  750. Abel interview 2021: László Lovász and Avi Wigderson
  751. Quantum optimization via four-body Rydberg gates
  752. On WL-rank and WL-dimension of some Deza circulant graphs
  753. On a Paley-Type Graph on Z n
  754. Lithium decoration characteristics for hydrogen storage enhancement in novel periodic porous graphene frameworks
  755. A centrality score of graph edges based on the Kemeny constant
  756. Accretion of the relativistic Vlasov gas in the equatorial plane of the Kerr black hole
  757. Modeling and performance optimization of two-terminal Cu2ZnSnS4–silicon tandem solar cells
  758. Systematic realization of low-frequency third-order sinusoidal oscillators
  759. Saved to My library
  760. A 1-separation formula for the graph Kemeny constant and Braess edges
  761. Pseudo-arc as the attractor in the disc–topological and measure-theoretic aspects
  762.  Can an Educational Activity Program Based on Feuerstein’s Program and Gardner’s Theory Increase Excellence and Creativity in Math in Omani Students?
  763.  Examining mathematical creativity of prospective mathematics teachers through problem posing
  764. Continuum limit of the lattice quantum graph Hamiltonian
  765. Solving problems on generalized convex graphs via mim-width
  766. Train as a Math Teacher: Creative and Proactive Process of Professional Development
  767. Distributive Laws, Spans and the ZX-Calculus
  768. The anti-Kekulé number of graphs
  769. A fast work-efficient SSSP algorithm for GPUs
  770. Continuity of the Spectrum of Dirac Operators of Spectral Triples for the Spectral Propinquity
  771. Graph Parameters, Implicit Representations and Factorial Properties
  772. Using Graphs in Processing of Light Microscope Medical Images
  773. A metaheuristic-based optimum tuning approach for tuned liquid dampers for structures
  774. Local weak limits of Laplace eigenfunctions
  776. A Complete Classification of Planar Graphs Associated with the Ideal of the Numerical Semigroup
  777. Computational Analysis of Topological Index-Based Entropies of Carbon Nanotube Y-Junctions
  778. Non-compact quantum graphs with summable matrix potentials
  779. Overview of the Tolerance Limit Calculations with Application to TSURFER
  780. Exact and approximate mean first passage times on trees and other necklace structures: a local equilibrium approach
  781. The application of ARIMA model to analyze COVID-19 incidence pattern in several countries
  782. On the wave turbulence theory for stochastic and random multidimensional KdV type equations
  783. Bipolar Fuzzy Planar Graphs
  784. Discrete harmonic functions on infinite penny graphs
  785. Interpretation of the color due to the ubiquitous nonenzymatic browning phenomena in foods
  786. Large expanders in high genus unicellular maps
  787. Backdoor attacks to graph neural networks
  788. Encoding the atomic structure for machine learning in materials science
  789.  Melonic large N limit of 5-index irreducible random tensors
  790. Scaling limit for random walk on the range of random walk in four dimensions
  791. Künneth theorems for Vietoris–Rips homology
  792. A statistical mechanism for operator growth
  793. A Precise GNSS Kinematic Observation Using Absolute Positioning Method at Bandar Universiti Residential Area: The precision of GNSS Kinematic Observation by …
  794. Commognition as an approach to studying proof teaching in university mathematics lectures
  795.  The effect of nonlinear electrodynamics on Joule-Thomson expansion of a 5-dimensional charged AdS black hole in Einstein-Gauss-Bonnet gravity
  796. Comparison and optimization of various moving patient-based real-time quality control procedures for serum sodium
  797. Bipolar fuzzy sets and bipolar fuzzy graphs
  798. The Neighborhood Polynomial of Chordal Graphs
  799. The Correlation Between Math Anxiety, Student Placement, and Academic Achievement in Mathematics Among Latino High School Students Enrolled in Algebra 1 …
  800. Regularity of binomial edge ideals of chordal graphs
  801. Markovian online matching algorithms on large bipartite random graphs
  802. Pregnancy weight gain in twin gestations and maternal and child health outcomes at 5 years
  803. The mess of mathematics: Organic creativity in teaching advanced mathematics
  804.  The Limits of Learning and Planning: Minimal Sufficient Information Transition Systems
  805. SIGMA: Semantic-complete Graph Matching for Domain Adaptive Object Detection
  806. Tiny golden angle ultrashort echo-time lung imaging in mice
  807. Configuration of five points in and their limits
  808. Teaching the economics of environmental policy with applications to energy, air pollution and climate change
  809. Discussion to: Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and FC Stingo
  810. Rate limits in quantum networks with lossy repeaters
  811. The chromatic number of random lifts of complete graphs
  812. Spectral analysis on Barlow and Evans’ projective limit fractals.
  814. Exploring the limits of the generation of nonclassical states of spins coupled to a cavity by optimal control
  815. Color-kinematics duality and dual conformal symmetry for a four-loop form factor in N= 4 SYM
  816. Review on optimization methodologies in transmission network reconfiguration of power systems for grid resilience
  817. A Wilson loop for off-shell amplitudes
  818. Visualizing Evolving Trees
  819. Partitions of Multigraphs Without C 4
  820. Graph-to-graph: towards accurate and interpretable online handwritten mathematical expression recognition
  821. Innovative Instructional Methods Integrating 21st-Century Competencies in Mathematics Education: Communication, Collaboration, Critical Thinking, Creativity
  822. Dirichlet energy constrained learning for deep graph neural networks
  823. Quasirandom Latin squares
  824. Delocalization transition of a disordered axion insulator
  825. Replica-mean-field limits of fragmentation-interaction-aggregation processes
  826. Counting Homomorphic Cycles in Degenerate Graphs∗
  827. A Note on Extremal Digraphs Containing at Most t Walks of Length k with the Same Endpoints
  828. Manta ray foraging optimization algorithm–based feedforward neural network for electric energy consumption forecasting
  829. The local limit of uniform spanning trees
  830.  Bird’s Engineering Mathematics
  831. Quantum algorithm for approximating maximum independent sets
  832. Novel spectrofluorimetric technique for determination of amoxicillin and ethopabate in chicken tissues, liver, kidney, eggs, and feed premix
  833.  Mastering Math Manipulatives, Grades K-3: Hands-On and Virtual Activities for Building and Connecting Mathematical Ideas
  834. Asynchronous Template Games and the Gray Tensor Product of 2-Categories
  835. Initial degenerations of spinor varieties
  836. Topoly: Python package to analyze topology of polymers
  837. Definable regularity lemmas for NIP hypergraphs
  838. Riesz decompositions for Schrödinger operators on graphs
  839. Madograms help to quantify mountain frontal zones—An approach towards comparative spatial analysis of complex landforms
  840. Functional Effects of Permeability on Oldroyd-B Fluid under Magnetization: A Comparison of Slipping and Non-Slipping Solutions
  841. A proposal for measuring the structure of economic ecosystems: a mathematical and complex network analysis approach
  842. … the interrelated impacts of type, quality and children’s awareness of design features and the mathematics content learning goals in digital math games and related …
  843. A review of time-series anomaly detection techniques: A step to future perspectives
  844. Autobert-zero: Evolving bert backbone from scratch
  845.  Quantum k-community detection: algorithm proposals and cross-architectural evaluation
  846. Connectivity for quantum graphs
  847. Verification Strategies for Feature-Oriented Software Product Lines
  848.  Empowering Deep Learning with Graphs
  849.  Exploring Our Schools
  850. On the computational tractability of statistical estimation on amenable graphs
  852. High-Level Stream and Data Parallelism in C++ for Multi-Cores
  853. On the vanishing of discrete singular cubical homology for graphs
  854. On exclusive sum labellings of hypergraphs
  855. Student Teachers’ Knowledge of Students’ Difficulties with the Concept of Function.
  856. Fluctuations of Subgraph Counts in Random Graphons
  857. Modeling and simulation of urban air quality with a 2-phase assessment technique
  858. White-noise driven conditional McKean–Vlasov limits for systems of particles with simultaneous and random jumps
  859. Extremal Digraphs Avoiding an Orientation of the Diamond
  860. Saved to My library
  861. A unified view of graph regularity via matrix decompositions
  862. Optimal gradient checkpoint search for arbitrary computation graphs
  863.  BIRS Report
  864. Teaching and learning sciences within the COVID-19 pandemic era in a Greek university department
  865.  Online summarization of dynamic graphs using subjective interestingness for sequential data
  866.  Large-time behavior of solutions of parabolic equations on the real line with convergent initial data III: unstable limit at infinity
  867. Polyadic sets and homomorphism counting
  868. Implicit SVD for Graph Representation Learning
  869.  Necessary and sufficient conditions for a difference constituted by four derivatives of a function involving trigamma function to be completely monotonic
  870. Global forcing number for maximal matchings in corona products
  871. Analysis and control of autonomous mobility-on-demand systems: A review
  872.  Random tensor theory for tensor decomposition
  873. Wronskian structures of planar symplectic ensembles
  874. Simultaneous determination of nitrate, nitrite and bromate by capillary zone electrophoresis in tea infusions grown in the Black Sea region of Turkey
  875.  RtI in math: Evidence-based interventions
  876. Two problems in extremal combinatorics
  877. Treewidth-pliability and PTAS for Max-CSPs
  878. On the enumeration of minimal non-pairwise compatibility graphs
  879. Comparison between the Deterministic and Stochastic Models of Nonlocal Diffusion
  880.  23 Undermining the “Bad at Math” Identity: Overhauling Differential Calculus to Empower Marginalized Students
  881. Twin-width and polynomial kernels
  882. Improved approximation algorithms for bounded-degree local hamiltonians
  883. Abundant accurate solitonic water and ionic liquid wave structures of the nanoparticle hybrid system
  884. Topological entropy of diagonal maps on inverse limit spaces
  886. Community detection and matrix completion with social and item similarity graphs
  887. Minimax rates in network analysis: Graphon estimation, community detection and hypothesis testing
  888. Quantifying longevity and circularity of copper for different resource efficiency policies at the material and product levels
  889. NeuroLKH: Combining deep learning model with lin-kernighan-helsgaun heuristic for solving the traveling salesman problem
  890. Parabolic Anderson model on critical Galton-Watson trees in a Pareto environment
  891. Saved to My library
  892. Bipolar Neutrosophic Competition Graphs
  893.  Making Earth, Making Home: Technoscientific Citizenship and Ecological Domesticity in an Age of Limits
  894. Exact Community Recovery in Correlated Stochastic Block Models
  895. Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth
  896.  Graph matching beyond perfectly-overlapping Erdős–Rényi random graphs
  897. Evolutionary optimization of convolutional neural network architecture design for thoracic x-ray image classification
  898. Bounds on Poisson approximation for the multicolour matching
  899. Spreadsheet analysis of the field-driven start-up flow in a microfluidic channel
  900. Invariant embeddings of unimodular random planar graphs
  901. On the sum of k largest laplacian eigenvalues of a graph and clique number
  902. LCD codes from equitable partitions of association schemes
  903. Dual Bayesian inference for risk-informed vibration-based damage diagnosis
  904. K-theory of right-angled Hecke C*-algebras
  905. f (R, T) Gravity model behaving as a dark energy source
  906. Quantifying nonlocality: how outperforming local quantum codes is expensive
  907. Warning Propagation: stability and subcriticality
  908. A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization
  909. A simplified force model for mixed traffic simulation
  910. Evidence of Feeling: Race, Police Violence, and the Limits of Documentation
  911. Graph Databases
  912.  Deep neural network models reveal interplay of peripheral coding and stimulus statistics in pitch perception
  913. On α -Vertex Choosability of Graphs
  914. Temperature Comparative Studies on Self-Assembly of Sodium Dodecyl Sulphate and Didodecyl Dimethyl Ammonium Bromide in Aqueous, Brine, and …
  915. Privacy and efficiency guaranteed social subgraph matching
  916. Mixing time and expansion of non-negatively curved Markov chains
  917. Effectiveness of video prompting delivered via augmented reality for teaching transition-related math skills to adults with intellectual disabilities
  918. Segmentation of Handwritten Mathematical Matrices Using the Area Voronoi Diagram
  919.  High-Confidence Computing
  920. How Middle School Math Inclusion Teachers Describe Standards-Based Instructional Approaches for Engaging Students with Disabilities
  921. The third AI summer: AAAI Robert S. Engelmore Memorial Lecture
  922. Finding counterexamples for a conjecture of Akbari, Alazemi and Andjeli\’c
  923. Nonparametric manifold learning approach for improved process monitoring
  924. An Empirical Evaluation of Network Representation Learning Methods
  925.  Novel constraints on neutrino physics beyond the standard model from the CONUS experiment
  926. Min-max theorem for the game of Cops and Robber on geodesic spaces
  927. Deep Graph Memory Networks for Forgetting-Robust Knowledge Tracing
  928. Network performance analysis from binding number prospect
  929.  Transferability of Spectral Graph Convolutional Neural Networks.
  930. GraphRedex: Look at your research
  931. A Sierpinski carpet like fractal without standard self-similar energy
  932. Functional convergence of continuous-time random walks with continuous paths
  933. Similarities and Representations of Graph Structures
  934.  Circular Coloring, Circular Flow, and Homomorphism of Signed Graphs
Prof.Fazal Rehman Shamil (Available for Professional Discussions)
1. Message on Facebook page for discussions,
2. Video lectures on Youtube
3. Email is only for Advertisement/business enquiries.