scientific article; zbMATH DE number 2229025
From MaRDI portal
Publication:5704408
Recommendations
Cited in
(97)- HyPAM: A hybrid continuum-particle model for incompressible free-surface flows
- Lower bounds in minimum rank problems
- Graph theory applications
- CHY-graphs on a torus
- Computation of contour integrals on \( \mathcal{M}_{0,n} \)
- \(\Lambda\) scattering equations
- Adaptive formation control of networked Lagrangian systems with a moving leader
- CHY loop integrands from holomorphic forms
- A tree-based model for setting optimal train fare zones
- Measuring instance difficulty for combinatorial optimization problems
- Paired threshold graphs
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
- Variable elimination in post-translational modification reaction networks with mass-action kinetics
- Resolvability in subdivision of circulant networks \(C_n[1, k]\)
- Hilbert function and facet ideals of products of simplicial complexes
- Geodesic nets with three boundary vertices
- \(k\)-Wiener index of a \(k\)-plex
- On the maxima of Motzkin-Straus programs and cliques of graphs
- Linear complexity of sequences on Koblitz curves of genus 2
- Reliability of maximum spanning tree identification in correlation-based market networks
- Analysis of divide-and-conquer strategies for the 0-1 minimization knapsack problem
- Edge importance in a network via line graphs and the matrix exponential
- Dynamics on binary relations over topological spaces
- An iterative algorithm for the management of an electric car-rental service
- Mutation on knots and Whitney's 2-isomorphism theorem
- Modified linear programming and class 0 bounds for graph pebbling
- Composite centrality: a natural scale for complex evolving networks
- On some applications of graph theory. I. (Reprint)
- Generalized fractional total colorings of graphs
- Facial unique-maximum edge and total coloring of plane graphs
- Recognizing nullhomotopic maps into the classifying space of a Kac-Moody group
- All graphs have antimagic total labelings
- A topological classification of convex bodies
- Clique Cover and Graph Separation
- An Introduction to Coding Sequences of Graphs
- scientific article; zbMATH DE number 434892 (Why is no real title available?)
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces
- Applications of Graph Theory in Linear Algebra
- A beginner's guide to graph theory
- An Algorithm for Qualitative Simulation of Gene Regulatory Networks with Steep Sigmoidal Response Functions
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- GA topology optimization using random keys for tree encoding of structures
- Finite prime distance graphs and 2-odd graphs
- Topics in Intersection Graph Theory
- scientific article; zbMATH DE number 1270594 (Why is no real title available?)
- Adinkras from ordered quartets of \(\mathrm{BC}_{4}\) Coxeter group elements and regarding another Gadget's 1,358,954,496 matrix elements
- Graph theory and its applications
- The design and implementation of an interactive course-timetabling system
- On the extremal total irregularity index of \(n\)-vertex trees with fixed maximum degree
- Generalised colouring sums of graphs
- Edge version of SDD and ISI index for rooted product graphs
- A genealogy of convex solids via local and global bifurcations of gradient vector fields
- A Topologically Complete Theory of Weaving
- Edge vertex prime labeling for some graphs
- Connecting coined quantum walks with Szegedy's model
- Vertex-edge neighborhood prime labeling of some trees
- On the metric dimension of barycentric subdivision of Cayley graphs
- On a graph isomorphic to its intersection graph: self-graphoidal graphs
- Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders
- The Herzog-Schönheim conjecture for finitely generated groups
- Coloring sums of extensions of certain graphs
- Examples of 4D, \(\mathcal{N} = 2\) holoraumy
- scientific article; zbMATH DE number 5237332 (Why is no real title available?)
- scientific article; zbMATH DE number 5052319 (Why is no real title available?)
- On the small cycle transversal of planar graphs
- scientific article; zbMATH DE number 2229033 (Why is no real title available?)
- scientific article; zbMATH DE number 5785643 (Why is no real title available?)
- Maximum total irregularity index of some families of graph with maximum degree n-1
- Ruleset optimization on isomorphic oritatami systems
- Some applications of graph theory to other parts of mathematics.
- The maximum number of triangles in a graph and its relation to the size of the Schur multiplier of special p-groups
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- Extending compositional data analysis from a graph signal processing perspective
- On the selection of an optimal outer approximation of a coherent lower probability
- Topics in Graph Theory
- Navigational guidance -- a deep learning approach
- CONNECTED COMMON NEIGHBORHOOD SYSTEMS OF CLIQUES IN A GRAPH: A POLYNOMIAL REPRESENTATION
- INDUCED CYCLE POLYNOMIAL OF A GRAPH
- CONNECTED TOTAL DOMINATING NEIGHBORHOOD POLYNOMIAL OF GRAPHS
- APPLICATION OF HOSOYA POLYNOMIAL TO SOLVE A CLASS OF TIME-FRACTIONAL DIFFUSION EQUATIONS
- CONVEX INDEPENDENT COMMON NEIGHBORHOOD POLYNOMIAL OF A GRAPH
- COMBINATORIAL APPROACH FOR COUNTING GEODETIC SETS WITH SUBDOMINATING NEIGHBORHOOD SYSTEMS
- RATIONAL WEIGHT OF A GRAPH
- CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS
- STAR POLYNOMIAL OF THE CORONA OF GRAPHS
- INDUCED PATH POLYNOMIAL OF GRAPHS
- Graph theoretic foundations of multibody dynamics. I: Structural properties
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices
- Coincidence points for hybrid pair of mappings via digraphs in vector metric spaces
- Fault-tolerant metric dimension of barycentric subdivision of Cayley graphs
- Flow methods for cooperative games with generalized coalition configuration
- Hypercontact semilattices
- A synthesis for uniformly 3-edge-connected graphs
- Random line graphs and edge-attributed network inference
- The Frank graph
- A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704408)
