scientific article; zbMATH DE number 1179517
From MaRDI portal
Publication:4398864
zbMath0902.05016MaRDI QIDQ4398864
Publication date: 28 July 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Minimum strictly fundamental cycle bases of planar graphs are hard to find, Minimum degree distance among cacti with perfect matchings, The clique number and the smallest \(Q\)-eigenvalue of graphs, On the Zarankiewicz problem for intersection hypergraphs, Polynomial invariants for arbitrary rank \(D\) weakly-colored stranded graphs, On the dynamics of a class of multi-group models for vector-borne diseases, On the extreme eccentric distance sum of graphs with some given parameters, On the uniqueness of some girth eight algebraically defined graphs, Computing the Tutte polynomial of Archimedean tilings, Noise-stability and central limit theorems for effective resistance of random electric networks, On the general sum-connectivity index of tricyclic graphs, Tutte polynomials for benzenoid systems with one branched hexagon, Tutte polynomial of scale-free networks, Entropy and stability of phase synchronisation of oscillators on networks, A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in directed acyclic graphs and reliability, All Ramsey numbers for brooms in graphs, On constructing rational spanning tree edge densities, Diagonalization of generalized lollipop graphs, Generalized Ramsey numbers through adiabatic quantum optimization, Exact and approximate algorithms for movement problems on (special classes of) graphs, Edge-transitivity of Cayley graphs generated by transpositions, Some extremal properties of the resolvent energy, Estrada and resolvent Estrada indices of graphs, Decomposing highly edge-connected graphs into paths of any given length, Proof of a conjecture on monomial graphs, Extremal results for random discrete structures, Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction, Cluster synchronization analysis of complex dynamical networks by input-to-state stability, Bounds on the 2-rainbow domination number of graphs, Computing hypergraph Ramsey numbers by using quantum circuit, Minoration of the complexity function associated to a translation on the torus, Pfaffian graphs embedding on the torus, On compatibility of discrete full conditional distributions: a graphical representation approach, Vanishing ideals over complete multipartite graphs, The complexity of weighted counting for acyclic conjunctive queries, On the Turán number of forests, Embedding cycles in finite planes, The adjacency matroid of a graph, Shattering, graph orientations, and connectivity, A port-Hamiltonian approach to power network modeling and analysis, Total rainbow \(k\)-connection in graphs, On the spectrum of Wenger graphs, Abelian quiver invariants and marginal wall-crossing., Some extremal problems for hereditary properties of graphs, Extremal problems for the \(p\)-spectral radius of graphs, Finite groups whose prime graphs are regular., The average reliability of a graph, Rental harmony with roommates, Perfect matchings in 3-partite 3-uniform hypergraphs, On hyper-Kirchhoff index, Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number, On a group testing problem: characterization of graphs with 2-complexity and maximum number of edges, On extremal hypergraphs for Hamiltonian cycles, Sparse reliable graph backbones, Forbidding and enforcing on graphs, On plane graphs with link component number equal to the nullity, On rainbow-\(k\)-connectivity of random graphs, Monomial graphs and generalized quadrangles, Conical and spherical graphs, The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs, Estimation of means in graphical Gaussian models with symmetries, Testing connectivity of faulty networks in sublinear time, The number of independent sets of tricyclic graphs, Cycles in projective spaces, The structure and metric dimension of the power graph of a finite group, Graph homomorphisms between trees, Spectral bounds for the independence ratio and the chromatic number of an operator, Extremal unicyclic graphs with minimal distance spectral radius, Equal distribution of satellite constellations on circular target orbits, On coloring box graphs, Potential distribution on random electrical networks, MAX-plus objects to study the complexity of graphs, Dynamics and kinetic limit for a system of noiseless \(d\)-dimensional Vicsek-type particles, Binary matroids and local complementation, Judicious partitions of uniform hypergraphs, Regularity and algebraic properties of certain lattice ideals, New classes of extremal graphs with given bandwidth, Zeros of Jones polynomials of graphs, Spanning forests in regular planar maps, Characterizations of Mersenne and 2-rooted primes, Extrema of graph eigenvalues, NLS ground states on graphs, Groups that are transitive on all partitions of a given shape, The equitable vertex arboricity of complete tripartite graphs, On minimum reload cost cycle cover, Notes on ``Bipolar fuzzy graphs, Topological chirality of a type of DNA and protein polyhedral links, Bollobás-Riordan and relative Tutte polynomials, Complex and detailed balancing of chemical reaction networks revisited, Counting polynomials with distinct zeros in finite fields, Cacti with maximum eccentricity resistance-distance sum, The influence of the complete nonexterior square graph on some infinite groups, Hydras: complexity on general graphs and a subclass of trees, Necessary and sufficient conditions for consensus in nonlinear monotone networks with unilateral interactions, Rainbow matchings and rainbow connectedness, Rainbow Turán problems for paths and forests of stars, On the distribution of the domination number for random class cover catch digraphs, Matroid invariants and counting graph homomorphisms, Annihilators in zero-divisor graphs of semilattices and reduced commutative semigroups, A dichotomy for real weighted Holant problems, Bifurcation without parameters in circuits with memristors: a DAE approach, Eigenvalues and degree deviation in graphs, Sublattices of certain Coxeter lattices, Analytical and statistical studies of Rodriguez-Velazquez indices, The complexity of flow expansion and electrical flow expansion, SIR dynamics with vaccination in a large configuration model, A sufficient condition for edge 6-colorable planar graphs with maximum degree 6, Some further results on the maximal hitting times of trees with some given parameters, On the occurrence of the complete graph \(K_5\) in the Hasse graph of a finite group., Asymptotic periodicity of recurrent flows in infinite networks, Optimal scheduling of peer-to-peer file dissemination, Linearly independent vertices and minimum semidefinite rank, Reconstruction of graphs based on random walks, \(\Delta \)-list vertex coloring in linear time, A contribution to the Zarankiewicz problem, Augmenting the connectivity of outerplanar graphs, Walks and the spectral radius of graphs, Eulerian colorings and the bipartizing matchings conjecture of Fleischner, Non-bipartiteness of graphs and the upper bounds of Dirichlet forms, Defining matroids through sequential selection, Robust kernel Isomap, Networks based on collisions among mobile agents, Graphs and matrices with maximal energy, The performance model of dynamic virtual organization (VO) formations within grid computing context, Drawing disconnected graphs on the Klein bottle, A new class of Ramsey-Turán problems, Vertex-coloring 2-edge-weighting of graphs, Large joints in graphs, Bounds for chromatic number in terms of even-girth and booksize, Algebraic methods for parameterized codes and invariants of vanishing ideals over finite fields, Ordering unicyclic graphs in terms of their smaller least eigenvalues, On optimality of a polynomial algorithm for random linear multidimensional assignment problem, On tricyclic graphs whose second largest eigenvalue does not exceed 1, Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs, Completing partial packings of bipartite graphs, Edge cover by connected bipartite subgraphs, Distinguishing graphs by their left and right homomorphism profiles, Collaborative software infrastructure for adaptive multiple model simulation, Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs, On the Ornstein-Zernike behaviour for the Bernoulli bond percolation on \({\mathbb{Z}}^{d}, d\geq3\), in the supercritical regime, The number of spanning trees in self-similar graphs, The cycle discrepancy of three-regular graphs, Dynamical properties of electrical circuits with fully nonlinear memristors, Extended Petersen networks, Spectral and combinatorial properties of some algebraically defined graphs, A revised model of fluid transport optimization in \textit{Physarum polycephalum}, Highly connected subgraphs of graphs with given independence number (extended abstract), Unique coverage in Boolean models, Maximum cardinality neighbourly sets in quadrilateral free graphs, Evolutionary potential games on lattices, Adinkras from ordered quartets of \(BC_{4}\) Coxeter group elements and regarding 1,358,954,496 matrix elements of the gadget, Star-critical Ramsey number of \(F_n\) versus \(K_4\), Modeling of physical network systems, Controllability of linear passive network behaviors, Graphs with the fewest matchings, Feynman graph generation and calculations in the Hopf algebra of Feynman graphs, On distribution function of the diameter in uncertain graph, Recent advances on failure and recovery in networks of networks, Topological graph polynomial and quantum field theory. II: Mehler kernel theories, Extremal graph characterization from the bounds of the spectral radius of weighted graphs, Potential games in volatile environments, An overlapping additive Schwarz preconditioner for the Laplace-Beltrami equation using spherical splines, Eigenvalues and diameter, On certain Coxeter lattices without perfect sections, On the sum of \(k\) largest singular values of graphs and matrices, A computational approach to Conway's thrackle conjecture, The interlace polynomial of a graph, An overlapping additive Schwarz preconditioner for interpolation on the unit sphere with spherical radial basis functions, Torsion formulas for signed graphs, Characterization and partial synthesis of the behavior of resistive circuits at their terminals, On the spectral radius of quasi-\(k\)-cyclic graphs, \(H\)-coloring tori, Commutative Boolean monoids, reduced rings, and the compressed zero-divisor graph, Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals, Random walks and flights over connected graphs and complex networks, Rainbow graph splitting, Similarity matrix framework for data from union of subspaces, A stability theorem for maximal \(K_{r+1}\)-free graphs, Markov-binary visibility graph: a new method for analyzing complex systems, Multiple Hamilton cycles in bipartite cubic graphs: an algebraic method, Additive representation of symmetric inverse \(M\)-matrices and potentials, Incremental spectral clustering by efficiently updating the eigen-system, Cycle bases of graphs and sampled manifolds, Perturbations of finite networks and asymptotic periodicity of flow semigroups, On the location of roots of graph polynomials, Graded Hochschild cohomology of a path algebra with oriented cycles., Computing HOMFLY polynomials of 2-bridge links from 4-plat representation, Tricyclic graph with maximal Estrada index, On an extremal hypergraph problem related to combinatorial batch codes, A polynomial invariant and duality for triangulations, Recurrence or transience of random walks on random graphs generated by point processes in \(\mathbb{R}^d\), Graph functions maximized on a path, Degree powers in \(C_5\)-free graphs, The number of independent sets of unicyclic graphs with given matching number, Cyclic matrices of weighted digraphs, A dynamic analysis of collusive networks, Spanning 2-forests and resistance distance in 2-connected graphs, Rank-two 5d SCFTs from M-theory at isolated toric singularities: a systematic study, Quantitative graph theory: a new branch of graph theory and network science, Counting nilpotent endomorphisms, The effect on the Laplacian spectral radius of a graph by adding or grafting edges, On the spectral radius of unicyclic graphs with fixed diameter, Bounds on graph eigenvalues. I, Edge-bandwidth of grids and tori, The degree distribution of the generalized duplication model, Enumeration of subtrees of trees, On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction, Optimization problems of the third edge-connectivity of graphs, The energy of graphs and matrices, Eigenvalues and extremal degrees of graphs, Eigenvalue problems of Nordhaus--Gaddum type, Making the components of a graph \(k\)-connected, Eigenvalues and forbidden subgraphs. I., On the upper bounds of the numbers of perfect matchings in graphs with given parameters, Coalescent random walks on graphs, A degree constraint for uniquely Hamiltonian graphs, Clustering of spectra and fractals of regular graphs, The minimum number of hubs in networks, On redundant topological constraints, Tutte's barycenter method applied to isotopies, An application of Ramsey theorem to stopping games., Efficiency in decentralized oligopolistic markets, Network synchronization using invariant-manifold-based diffusive dynamic couplings with time-delay, Causality, influence, and computation in possibly disconnected synchronous dynamic networks, Some remarks on the compressed zero-divisor graph, Hamiltonian double Latin squares, Formation control of a multi-agent system subject to Coulomb friction, Ramsey numbers involving large dense graphs and bipartite Turán numbers, Graphs with large maximum degree containing no odd cycles of a given length, On the first Hochschild cohomology of admissible algebras., Exact partition functions for the \(q\)-state Potts model with a generalized magnetic field on lattice strip graphs, Zeros of the Jones polynomials for families of pretzel links, Integer sequence discovery from small graphs, Nearly bipartite graphs, The energy of \(C_4\)-free graphs of bounded degree, On the spectrum of the normalized graph Laplacian, A sharp upper bound on the spectral radius of weighted graphs, Remarks on the minus (signed) total domination in graphs, The proof of a conjecture concerning acyclic molecular graphs with maximal Hosoya index and diameter 4, Graph decompositions for demographic loop analysis, Extra edge connectivity and isoperimetric edge connectivity, Graphs and Hermitian matrices: Exact interlacing, Spectral decomposition of square-tiled surfaces, Playing off-line games with bounded rationality, Multiple packing in sum-type metric spaces, On chromatic and flow polynomial unique graphs, The stochastic weighted complexity of a group covering of a digraph, Separator theorems and Turán-type results for planar intersection graphs, Structure-based graph distance measures of high degree of precision, Cores of simplicial complexes, Topological evolution in dense granular materials: a complex networks perspective, A graph-theoretic approach to a partial order of knots and links, Tutte polynomials for counting and classifying orbits, The spectral radius of graphs without paths and cycles of specified length, Weighted graph colorings, Dynamic bottleneck optimization for \(k\)-edge and 2-vertex connectivity, Treewidth computations. I: Upper bounds, Vertex Turán problems in the hypercube, On graphs determining links with maximal number of components via medial construction, Weighted-set graph colorings, Augmented nodal matrices and normal trees, Tricyclic graphs with maximum Merrifield-Simmons index, On the extremal Zagreb indices of graphs with cut edges, Expected values of parameters associated with the minimum rank of a graph, Note on 2-rainbow domination and Roman domination in graphs, A little statistical mechanics for the graph theorist, \(\mathbb Z\)-rationality of a certain class of formal series, Ramsey goodness and generalized stars, On the maximum Zagreb indices of graphs with \(k\) cut vertices, Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions, The semigroup approach to transport processes in networks, Multiscale stochastic modeling for tractable inference and data assimilation, Sharp bounds for the spectral radius of digraphs, Spectral structure of the Laplacian on a covering graph, Highly connected random geometric graphs, Large induced trees in \(K_r\)-free graphs, Symmetries and the complexity of pure Nash equilibrium, Tutte chromatic identities from the Temperley-Lieb algebra, Integrated functionals of normal and fractional processes, The equitable dispersion problem, On Tutte polynomial uniqueness of twisted wheels, Integral cycle bases for cyclic timetabling, From a zoo to a zoology: Towards a general theory of graph polynomials, A bijection for Eulerian-equivalence classes of totally cyclic orientations, Harmonic analysis for graph refinements and the continuous graph FFT, The maximum spectral radius of \(C_4\)-free graphs of given order and size, Searching for an edge in a graph with restricted test sets, Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial, The 3-colored Ramsey number of even cycles, Graph spectra as a systematic tool in computational biology, Uniformly bounded information and social choice, Vertex-compressed subalgebras of a graph von Neumann algebra, Matchings and independent sets of a fixed size in regular graphs, A greedy approach to compute a minimum cycle basis of a directed graph, A lower bound on the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction, More spectral bounds on the clique and independence numbers, Determinant identities for Laplace matrices, Highly connected coloured subgraphs via the regularity Lemma, Edge search in graphs with restricted test sets, Turán's theorem inverted, Enhanced algorithms for local search, Acyclic choosability of graphs with bounded degree, A new family of algebraically defined graphs with small automorphism group, Ramsey numbers of fans and large books, Turán numbers for hypergraph star forests, Subconstituents of unitary Cayley graph of matrix algebras, Forman-Ricci curvature and persistent homology of unweighted complex networks, Hermitian matrices and graphs: Singular values and discrepancy, Minimal congestion trees, The Turán numbers of special forests, The facets and the symmetries of the approval-voting polytope, Large generalized books are \(p\)-good, Multicolour Turán problems, The rapid mixing of random walks defined by an \(n\)-cube, The structure and number of global roundings of a graph, Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti, Forbidden subgraphs in reduced power graphs of finite groups, On elegant labelling and magic labelling of large-scale graphs, Universal Tutte polynomial, Homogenization of stiff inclusions through network approximation, Isolation of \(k\)-cliques. II, A general method for computing Tutte polynomials of self-similar graphs, The minimum degree threshold for perfect graph packings, Modeling and passivity properties of multi-producer district heating systems, Kantorovich distance on finite metric spaces: Arens-Eells norm and CUT norms, Bypass rewiring and extreme robustness of Eulerian networks, A novel measure of edge and vertex centrality for assessing robustness in complex networks, Games, graphs and Kirchhoff laws, Certifying the global optimality of quartic minimization over the sphere, Some extremal results on hypergraph Turán problems, Star-critical Ramsey numbers involving large generalized fans, The structure of the genetic code as an optimal graph clustering problem, Algorithmic techniques for finding resistance distances on structured graphs, Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance, Forbidding multiple copies of forestable graphs, The subgroup graph of a group, On the second largest eigenvalue of the signless Laplacian, The algebra of reversible Markov chains, Scaling limits for width two partially ordered sets: the incomparability window, Simultaneous classification and community detection on heterogeneous network data, Poset graphs and the lattice of graph annihilators, Sharp benefit-to-cost rules for the evolution of cooperation on regular graphs, On graphs related to comaximal ideals of a commutative ring, The social climbing game, On private computation in incomplete networks, Decomposition of realizable fuzzy relations, Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence, On rainbow-free colourings of uniform hypergraphs, Variational community partition with novel network structure centrality prior, On the convergence time of a natural dynamics for linear programming, On some cycles in Wenger graphs, On the distance and distance signless Laplacian spectral radii of tricyclic graphs, An algorithmic framework for obtaining lower bounds for random Ramsey problems, Spectral based hypothesis testing for community detection in complex networks, Geometric properties of infinite graphs and the Hardy-Littlewood maximal operator, The quality of genetic code models in terms of their robustness against point mutations, The Jones polynomial and functions of positive type on the oriented Jones-Thompson groups \(\vec{F}\) and \(\vec{T} \), Quantum walks on hypergraphs, The number of spanning trees of a family of 2-separable weighted graphs, An NP-completeness result of edge search in graphs, On sums of graph eigenvalues, Graphs with maximal Hosoya index and minimal Merrifield-Simmons index, On the AVDTC of 4-regular graphs, A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model, Eigenvalues and chromatic number of a signed graph, Minimum constellation covers: hardness, approximability and polynomial cases, \(p\)-arrangeable graphs are Folkman linear, Edge-disjoint spanning trees and forests of graphs, On the Kirchhoff index of a unicyclic graph and the matchings of the subdivision, Resistance distance and Kirchhoff index of the Q-vertex (or edge) join graphs, On the bi-Lipschitz geometry of lamplighter graphs, \({\mathcal{W}}_\infty \)-transport with discrete target as a combinatorial matching problem, Finite space Kantorovich problem with an MCMC of table moves, A Laplacian approach to \(\ell_1\)-norm minimization, Nearly Gorenstein rings arising from finite graphs, Spreading properties for SIR models on homogeneous trees, The hitting times of random walks on bicyclic graphs, Complexity traits and synchrony of cryptocurrencies price dynamics, On the resistance diameter of hypercubes, Approximate controllability of network systems, Stochastic resonance in coupled star-networks with power-law heterogeneity, Equitable edge partitions and Kirchhoff graphs, The vertex Turán density in 3-ary \(n\)-cubes, A point-conic incidence bound and applications over \(\mathbb{F}_p\), Metric graphs, cross ratios, and Rayleigh's laws, Groups as automorphisms of dessins d'enfants, Rainbow saturation, On the maxima of Motzkin-Straus programs and cliques of graphs, Classical results for alternating virtual links, The distance orientation problem, Biomolecular topology: modelling and analysis, \textsc{Azurite}: an algebraic geometry based package for finding bases of loop integrals, Connectivity of triangulation flip graphs in the plane, Irreducibility of the Tutte polynomial of an embedded graph, Graphical structure of double controlled metric-like spaces with an application, FPT algorithms for generalized feedback vertex set problems, Stable set rings which are Gorenstein on the punctured spectrum, Counting cycles and finite dimensional \(L^{p}\) norms, Fisher information and synchronisation transitions: a case-study of a finite size multi-network Kuramoto-Sakaguchi system, The number of 2-SAT functions, Some two-vertex resistances of nested triangle network, Fixed points and stability in the two-network frustrated Kuramoto model, Synchronisation of networked Kuramoto oscillators under stable Lévy noise, Spreading dynamics in heterogeneous graphs: beyond the assortativity coefficient, Bertrand competition under network externalities, Macdonald cumulants, \(G\)-inversion polynomials and \(G\)-parking functions, Extremal graphs with diameter 2 for two indices on resistance-distance, Limiting behavior of 3-color excitable media on arbitrary graphs, Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges, A proposal on culling \& filtering a Coxeter group for 4D, \( \mathcal{N} =1\) spacetime SUSY representations: revised, Port-Hamiltonian modeling of non-isothermal chemical reaction networks, Graphs and metric 2-step nilpotent Lie algebras, Weighted sampling without replacement, Hierarchical neural networks perform both serial and parallel processing, The multiplication table problem for bipartite graphs, Concentric network symmetry, On the chromatic number of structured Cayley graphs, The power grid as a complex network: a survey, On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices, Systematic evaluation of a new combinatorial curvature for complex networks, Maximal Estrada index of unicyclic graphs with perfect matching, Consensus dynamics with arbitrary sign-preserving nonlinearities, Ground states of nonlinear Schrödinger equation on star metric graphs, Monochromatic trees in random graphs, Discovering linear-recurrent solutions to Hofstadter-like recurrences using symbolic computation, Total rainbow connection of digraphs, A study about the Tutte polynomials of benzenoid chains, Duality and nonlinear graph Laplacians, Rainbow vertex connection of digraphs, Synchronisation under shocks: the Lévy Kuramoto model, Singularities in Negami's splitting formula for the Tutte polynomial, The minimum size of graphs satisfying cut conditions, On linkedness in the Cartesian product of graphs, Integral homology of random simplicial complexes, Partial immunization processes, Attributed transition systems with hidden transitions, Free energy as a dynamical invariant (or can you hear the shape of a potential?), Semidirect product constructions of directed strongly regular graphs, Degree powers in graphs with a forbidden forest, Event-triggered sliding mode based consensus tracking in second order heterogeneous nonlinear multi-agent systems, Pfaffian polyominos on the Klein bottle, Information content based model for the topological properties of the gene regulatory network of \textit{Escherichia coli}, Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences, The expected hitting times for graphs with cutpoints., On the number of edges not covered by monochromatic copies of a fixed graph., On homomorphisms from the Hamming cube to \(\mathbb{Z}\), Measure concentration and the weak Pinsker property, The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes, Fault tolerant supergraphs with automorphisms, Twin subgraphs and core-semiperiphery-periphery structures, On an extension of the d'Alembert solution to initial-boundary value problems in multi-layered, multi-material domains, Identities for circuit partition polynomials, with applications to the Tutte polynomial, On the algebraic complexity of some families of coloured Tutte polynomials, Bivariate chromatic polynomials in computer algebra, Graph vulnerability parameters, compression, and quasi-threshold graphs, Uniform Kirchhoff graphs, Temporal network optimization subject to connectivity constraints, Non-commutative crepant resolutions of Hibi rings with small class group, Enumerative combinatorics of simplicial and cell complexes: Kirchhoff and Trent type theorems, Modeling systemic risk with Markov switching graphical SUR models, The Wiener index of Sierpiński-like graphs, Gaussian noise and the two-network frustrated Kuramoto model, Highly connected subgraphs of graphs with given independence number, Matrices over finite fields and their Kirchhoff graphs, Estimating the effect of the reorganization of interactions on the adaptability of species to changing environments, Decomposing highly connected graphs into paths of length five, Matroidal structure of rough sets from the viewpoint of graph theory, Measuring instance difficulty for combinatorial optimization problems, Efficient algorithms for the double traveling salesman problem with multiple stacks, Graphs and Hermitian matrices: eigenvalue interlacing, Super restricted edge-connectivity of vertex-transitive graphs, Efficiency test of pseudorandom number generators using random walks, Books in graphs, Small sets and Markov transition densities., Parallel connections and coloured Tutte polynomials, The Kauffman brackets for equivalence classes of links, Group detection in complex networks: an algorithm and comparison of the state of the art, Interaction in agent-based economics: a survey on the network approach, Potts model partition functions on two families of fractal lattices, Variability analysis of complex networks measures based on stochastic distances, Sandpile models, Dynamic characterization of typical electrical circuits via structural properties, Natural selection of altruism in inelastic viscous homogeneous populations, About the determination of quasi steady state storativity and connectivity matrix of wells in 3D heterogeneous formations, Segregating Markov chains, A hypergraph extension of the bipartite Turán problem, Random walks on a finite graph with congestion points, Weighted expanders and the anisotropic Alon-Boppana theorem, Exploring the Tutte-Martin connection, Connections between loops of exponent 2, reflection structures and complete graphs with parallelism, Exact Potts model partition function on strips of the triangular lattice, Graph-theoretical characterization of invertible cellular automata, Alternating knot diagrams, Euler circuits and the interlace polynomial, General structural results for Potts model partition functions on lattice strips, On generalized Ramsey theory: The bipartite case, Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders, Evaluations of the circuit partition polynomial, Perfect Clar structures and 3-homogeneous simplicial complexes, 4-edge-coloring graphs of maximum degree 3 in linear time, Neighbourhood graphs of Cayley graphs for finitely-generated groups, Wavelength routing in optical networks of diameter two, Individual security, contagion, and network design, On the Laplacian coefficients of tricyclic graphs with prescribed matching number, Counting coloured planar maps: differential equations, The replacements of signed graphs and Kauffman brackets of link families, Identifying stochastic basin hopping by partitioning with graph modularity, Disjoint complete minors and bipartite minors, On stability of discrete-time switched systems, Planar polycyclic graphs and their Tutte polynomials, Heat bounds and the blowtorch theorem, Structure of the partition function and transfer matrices for the Potts model in a magnetic field on lattice strips, Numerical radius and zero pattern of matrices, Riemann-Roch and Abel-Jacobi theory on a finite graph, Enumeration of algebras close to absolutely free algebras and binary trees, Graphical models for imprecise probabilities, Discretization of compact Riemannian manifolds applied to the spectrum of Laplacian, Noncommutative Riemannian geometry and diffusion on ultrametric Cantor sets, Leader-follower consensus over numerosity-constrained random networks, Branched polymers and hyperplane arrangements, Collusion in atomic splittable routing games, Edge cut splitting formulas for Tutte-Grothendieck invariants, Realizations of quasi-polynomial systems and application for stability analysis, Decomposing regular graphs with prescribed girth into paths of given length, On some cycles in linearized Wenger graphs, Computational and analytical studies of the Randić index in Erdős-Rényi models, On two extensions of the classical zero-divisor graph, Vertex coloring of a graph for memory constrained scenarios, A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree, Abstract tropical linear programming, Spectral determinants and an Ambarzumian type theorem on graphs, Distance geometry and data science, Joins, ears and Castelnuovo-Mumford regularity, Synchronization problems in computer vision with closed-form solutions, Biodiversity in model ecosystems. I: Coexistence conditions for competing species, Network topology and self-consistency in language games, The multicolour size-Ramsey number of powers of paths, The impact of potential-based physics models on pricing in energy networks, Some two-vertex resistances of the three-towers Hanoi graph formed by a fractal graph, On the (reverse) cover cost of trees with some given parameters, Wilson loop expectations in lattice gauge theories with finite gauge groups, Adversarial decision strategies in multiple network phased oscillators: the Blue-Green-Red Kuramoto-Sakaguchi model, Optimally connected hybrid complex networks with windmill graphs backbone, Two Erdős-Hajnal-type theorems in hypergraphs, Many cliques with few edges, Graph vulnerability parameters, compression, and threshold graphs, Polynomial configurations in sets of positive upper density over local fields, Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph, Diffusive scaling of the Kob-Andersen model in \({\mathbb{Z}}^d \), Graphs whose independence fractals are line segments, On the characterization of some algebraically defined bipartite graphs of girth eight, A combinatorial expression for the group inverse of symmetric \(M\)-matrices, On vertex-induced weighted Turán problems, Complexity of stability, Variation of Tamagawa numbers of Jacobians of hyperelliptic curves with semistable reduction, Curriculum spaces and mathematical models for curriculum design, Tutte polynomials of Fan-like graphs with applications in benzenoid systems, Maxima of the \(Q\)-index: forbidden odd cycles, Keeping avoider's graph almost acyclic, On graphs and codes preserved by edge local complementation, Decomposition of directed graphs and the Turán problem, Maxima of the \(Q\)-index: forbidden even cycles, Decomposition and convergence for tree martingales, A logician's view of graph polynomials, An improved linear kernel for the cycle contraction problem, Extremal infinite graph theory, Counting colored planar maps: algebraicity results, Tutte polynomials of alternating polycyclic chains, Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6, Generalized Hamming weights of projective Reed-Muller-type codes over graphs, Tutte polynomials for directed graphs, Some properties on resistance distance spectral radius, Multi-agent coordination over local indexes via clique-based distributed assignment, Zeroth-order general Randić index of cactus graphs, A linear relation between input and first layer in neural networks, The generating function of planar Eulerian orientations, Null actions and RIM non-open extensions of strongly proximal actions, Random self-similar trees: a mathematical theory of Horton laws, Inhomogeneous restricted lattice walks, The Turań number of \(2P_7\), Study of exponential growth constants of directed heteropolygonal Archimedean lattices, The maximum number of colorings of graphs of given order and size: a survey, Diffusion and consensus on weakly connected directed graphs, Counting copies of a fixed subgraph in \(F\)-free graphs, Acyclic coloring of graphs with maximum degree at most six, Randomized algorithms for stabilizing switching signals, \(\mathit\Gamma\)-convergence of the Heitmann-Radin sticky disc energy to the crystalline perimeter, The graph spectra and spectral moments of random graphs, Cops, a fast robber and defensive domination on interval graphs, Planar Turán numbers of short paths, Interpretations of the Tutte polynomials of regular matroids, The characteristic polynomial of generalized lollipop graphs, Octonion multiplication and Heawood's map, Bounds on the spectral radii of digraphs in terms of walks, Linearized Wenger graphs, Path decompositions of digraphs and their applications to Weyl algebra, Flows, currents, and cycles for Markov chains: large deviation asymptotics, Decompositions of triangle-free 5-regular graphs into paths of length five, Role of normalization in spectral clustering for stochastic blockmodels, Synchronization of coupled chaotic maps, Resistance distances in Cayley graphs on symmetric groups, On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph, Structure and stability of the equilibrium set in potential-driven flow networks, Cooperation through social influence, Clique-coloring claw-free graphs, \textit{Physarum} can compute shortest paths, Best constants for the Hardy-Littlewood maximal operator on finite graphs, Burnside's problem, spanning trees and tilings., Cliques and the spectral radius, Co-degree density of hypergraphs, Random fractals and tree-indexed Markov chains, Response solutions for strongly dissipative quasi-periodically forced systems with arbitrary nonlinearities and frequencies, Acyclic coloring of graphs with maximum degree 7, A survey of community detection methods in multilayer networks, Resistance characterizations of equiarboreal graphs, Continuum percolation with holes, A continuous family of equilibria in ferromagnetic media are ground states, Complex networks: structure and dynamics, Analysis and applications of spectral properties of grounded Laplacian matrices for directed networks, Local resilience for squares of almost spanning cycles in sparse random graphs, Total \(\{k\}\)-domination in special graphs, Compatibility, embedding and regularization of non-local random walks on graphs, On the maximum degree of path-pairable planar graphs, Extremal \(k\)-forcing sets in oriented graphs, Physical network systems and model reduction, Predicting state transitions in brain dynamics through spectral difference of phase-space graphs, Approximately uniformly locally finite graphs, A measure theoretic perspective on the space of Feynman diagrams, Many triangles with few edges, The maximum spectral radius of graphs without spanning linear forests, On the dot product of graphs over monogenic semigroups, Some transformations on multiplicative eccentricity resistance-distance and their applications, Boolean rings and reciprocal eigenvalue properties, On the Potts model partition function in an external field, Introduction to nonlinear dynamics of electronic systems: tutorial, Conductance, Laplacian and mixing rate in discrete dynamical systems, Conductance and noncommutative dynamical systems, On the Tutte-Krushkal-Renardy polynomial for cell complexes, Algebraic topology and the quantization of fluctuating currents, Triangulations of Cayley and Tutte polytopes, Flanders' theorem for many matrices under commutativity assumptions, Optimal classification in sparse Gaussian graphic model, Load balancing of dynamical distribution networks with flow constraints and unknown in/outflows, Long paths and cycles in subgraphs of the cube, A low temperature analysis of the boundary driven Kawasaki process, Average consensus problems in networks of agents with delayed communications, Binary matroids with no 4-spike minors, Stochastic (in)stability of synchronisation of oscillators on networks, A graph-theoretical approach for the analysis and model reduction of complex-balanced chemical reaction networks, Rainbow vertex \(k\)-connection in graphs, The graph matching problem, Graph ambiguity, Decentralized identification and control of networks of coupled mobile platforms through adaptive synchronization of chaos, On the connectivity properties and energy of Fibonomial graphs, Acyclic vertex coloring of graphs of maximum degree six, Rainbow connection for some families of hypergraphs, Universal construction mechanism for networks from one-dimensional symbol sequences, More eigenvalue problems of Nordhaus-Gaddum type, On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs, The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs, The general \(\alpha \)-decomposition problem of fuzzy relations, The Hilbert null-cone on tuples of matrices and bilinear forms, Proving the triviality of rational points on Atkin-Lehner quotients of Shimura curves, Bounds on graph eigenvalues. II, An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem, Planar zero-divisor graphs, The generating functions of hitting times for random walk on trees, Knot invariants and the Bollobás-Riordan polynomial of embedded graphs, Generalizing \(D\)-graphs, Scattering theory and discrete-time quantum walks, Joints in graphs, The sum of the squares of degrees: sharp asymptotics, Cycles and stability, Moduli of McKay quiver representations. II: Gröbner basis techniques, On monomial graphs of girth eight, On distinguishing trees by their chromatic symmetric functions, Highly connected monochromatic subgraphs, A spectral condition for odd cycles in graphs, The Jones polynomial and graphs on surfaces, Characterization of product anti-magic graphs of large order, Semigroups for flows in infinite networks, Exact Potts model partition functions for strips of the honeycomb lattice, Almost given length cycles in digraphs, Parity, Eulerian subgraphs and the Tutte polynomial, The smallest eigenvalue of \(K_{r}\)-free graphs, On the colored Tutte polynomial of a graph of bounded treewidth, Determinant of the distance matrix of a tree with matrix weights, Graph colourings and solutions of systems of equations over finite fields, Affinity and fluctuations in a mesoscopic noria, On the Ornstein-Zernike behaviour for the supercritical random-cluster model on \(\mathbb {Z}^{d}\), \(d\geq 3\), Topological order from quantum loops and nets, The unlabelled speed of a hereditary graph property, A note on triangle-free distance-regular graphs with \(a_2\neq 0\), The flow and tension spaces and lattices of signed graphs, Highly connected multicoloured subgraphs of multicoloured graphs, \(C_{3}\) saturated graphs, Ramsey functions involving \(K_{m,n}\) with \(n\) large, Large planar subgraphs in dense graphs, Distance matrix and Laplacian of a tree with attached graphs, Normality of semigroups with some links to graph theory., Extremal connectivity for topological cliques in bipartite graphs, On the complexity of unfrozen problems, An option-theoretic model of a reputation network, Cycles and paths in graphs with large minimal degree, Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs, Claw-free 3-connectedP11-free graphs are hamiltonian, Generation of bases with definite factorization for ann-qubit system and mutually unbiased sets construction, The study of the b-choromatic number of some classes of fractal graphs, Unnamed Item, A Folkman Linear Family, Knots and Graphs: Two Centuries of Interaction, Consensus Algorithm with Censored Data for Distributed Detection with Corrupted Measurements: A Game-Theoretic Approach, An Introduction to Temporal Graphs: An Algorithmic Perspective, A Tutte Polynomial for Maps, Handling Biological Complexity Using Kron Reduction, Network Topology and Synchronization of Systems with Linear Time-Delayed Coupling, The Sandpile Cellular Automaton, Parametric representation of rank d tensorial group field theory: Abelian models with kinetic term ∑sps+μ, Hyperbolic families and coloring graphs on surfaces, The small stellated dodecahedron code and friends, Eulerian properties of non-commuting and non-cyclic graphs of finite groups, The idempotent-divisor graphs of a commutative ring, Random geometric graphs and isometries of normed spaces, Introduction to Complex Networks: Structure and Dynamics, Mechanism design and communication networks, Cross-linked structure of network evolution, Deep graphs—A general framework to represent and analyze heterogeneous complex systems across scales, Synchronization on effective networks, Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model, Measures of spin ordering in the Potts model with a generalized external magnetic field, The anti-Ramsey threshold of complete graphs, Transcritical Bifurcation without Parameters in Memristive Circuits, Large Induced Subgraphs with $k$ Vertices of Almost Maximum Degree, The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis, Fixed parameterized algorithms for generalized feedback vertex set problems, ON THE COMPLEMENT OF THE ZERO-DIVISOR GRAPH OF A PARTIALLY ORDERED SET, Reaction Spreading in Systems With Anomalous Diffusion, \texttt{ADG}: automated generation and evaluation of many-body diagrams. I: Bogoliubov many-body perturbation theory, A graph-theoretic approach to a conjecture of Dixon and Pressman, Voltage lifts of graphs from a category theory viewpoint, Quantification and statistical analysis of topological features of recursive trees, A new upper bound for the Ramsey number of fans, Long Term Memory and the Densest K-Subgraph Problem, Loop-erased walks and total positivity, Graph polynomials and link invariants as positive type functions on Thompson’s group F, On the extended zero divisor graph of commutative rings, Patterns in Khovanov link and chromatic graph homology, The Connectivity of the Covering Approximation Space, Resilient Distributed Field Estimation, Entanglement entropy in the quantum networks of a coupled quantum harmonic oscillator, Metanetworks of artificially evolved regulatory networks, The scaling of the minimum sum of edge lengths in uniformly random trees, Adinkras from ordered quartets of BC4 Coxeter group elements and regarding another Gadget’s 1,358,954,496 matrix elements, On the four-dimensional holoraumy of the 4D, 𝒩 = 1 complex linear supermultiplet, Complexity of Total {k}-Domination and Related Problems, Turán and Ramsey Properties of Subcube Intersection Graphs, Chip-Firing and Riemann-Roch Theory for Directed Graphs, Catching a Fast Robber on Interval Graphs, Unnamed Item, Entropy, independent sets and antichains: A new approach to Dedekind’s problem, Links and cubic 3-polytopes, Unnamed Item, Unnamed Item, DAEs in Circuit Modelling: A Survey, Question/Answer Games on Towers and Pyramids, Overlapping additive Schwarz preconditioners for elliptic PDEs on the unit sphere, A Method for Sensor Placement Taking into Account Diagnosability Criteria, Hyperplane arrangement cohomology and monomials in the exterior algebra, The graded count of quasi-trees is not a knot invariant, A Separator Theorem for String Graphs and Its Applications, From Graph Theory to Models of Economic Networks. A Tutorial, Minimum path bases and relevant paths, Number and location of pre-images under harmonic mappings in the plane, Faces of Root Polytopes, Most graphs are knotted, Coloring the Voronoi tessellation of lattices, The number of cliques in graphs of given order and size, Scalable, Adaptable, and Fast Estimation of Transient Downtime in Virtual Infrastructures Using Convex Decomposition and Sample Path Randomization, Directing Road Networks by Listing Strong Orientations, Semantic Equivalence of Graph Polynomials Definable in Second Order Logic, Network synchronization of time-delayed coupled nonlinear systems using predictor-based diffusive dynamic couplings, K5‐free subgraphs of random graphs, Potential Wadge classes, Characterization and Computation of Partial Synchronization Manifolds for Diffusive Delay-Coupled Systems, Simplicial matrix-tree theorems, Spectral radius and Hamiltonicity of graphs with large minimum degree, The Common Structure of the Curves Having a Same Gauss Word, The relative degree and large complete minors in infinite graphs, Edge-statistics on large graphs, On the number of symbols that forces a transversal, Sharp bounds for decomposing graphs into edges and triangles, Large deviations for sums of partly dependent random variables, Covering 3-Edge-Colored Random Graphs with Monochromatic Trees, Random MAX SAT, random MAX CUT, and their phase transitions, Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs, Hypergraphs with no odd cycle of given length, Nanonetworks: The graph theory framework for modeling nanoscale systems, Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs, Motifs for Processes on Networks, Quantum Mathematics in Artificial Intelligence, On Laplacian Monopoles, New Results on Chromatic Polynomials, Structure-Preserving Model Reduction of Physical Network Systems, A Method for Computation and Analysis of Partial Synchronization Manifolds of Delay Coupled Systems, A view from the bridge spanning combinatorics and probability, Graph connectivity and binomial edge ideals, Extremal Khovanov homology and the girth of a knot, A Most General Edge Elimination Polynomial, Evaluations of Graph Polynomials, Unnamed Item, Jones Representations of Thompson’s GroupFArising from Temperley–Lieb–Jones Algebras, The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs, Hamiltonicity and forbidden subgraphs in 4‐connected graphs, Refinement of Metrics: Erd\H{o}s Number, a Case Study, Ideal-based quasi zero divisor graph, Unnamed Item, A dichotomy characterizing analytic digraphs of uncountable Borel chromatic number in any dimension, The first two cacti with larger multiplicative eccentricity resistance-distance, A generic framework for approximation analysis of greedy algorithms for star bicoloring, Extremal hitting times of trees with some given parameters, On the oriented Thompson subgroup F→3 and its relatives in higher Brown–Thompson groups, Persistent Laplacians: Properties, Algorithms and Implications, Proper Lie automorphisms of incidence algebras, Unnamed Item, How Many Unicycles on a Wheel?, On some Multicolor Ramsey Properties of Random Graphs, Universality of Graphs with Few Triangles and Anti-Triangles, Tuza's Conjecture is Asymptotically Tight for Dense Graphs, The Proofs of Two Directed Paths Conjectures of Bollobás and Leader, Tetracyclic graphs with maximal Estrada index, Edge connectivity and the spectral gap of combinatorial and quantum graphs, Random Graphs and Their Subgraphs, Upper Tail Bounds for Cycles, Axiom of Choice, Maximal Independent Sets, Argumentation and Dialogue Games, Simultaneous Estimation of Nongaussian Components and Their Correlation Structure, Edge crossings in random linear arrangements, Topological reversibility and causality in feed-forward networks, Examples of 4D, 𝒩 = 2 holoraumy, Gluing graphs and the spectral gap: a Titchmarsh–Weyl matrix-valued function approach, The Homfly and dichromatic polynomials, q-plane zeros of the Potts partition function on diamond hierarchical graphs, Hamiltonian quantum simulation with bounded-strength controls, Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis, Book Ramsey numbers. I, Networks and Stability, The numbers of cut-vertices and end-blocks in 4-regular graphs, Combinatorics-Based Approaches to Controllability Characterization for Bilinear Systems, A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians, Sharp upper bounds of $A_\alpha$-spectral radius of cacti with given pendant vertices, Unnamed Item, Control of islanded microgrids considering power converter dynamics, Networks of diffusively time-delay coupled systems: Conditions for synchronization and its relation to the network topology, Maximum likelihood estimation for discrete exponential families and random graphs, Unnamed Item, Maximum number of colorings of (2k, k2)‐graphs, Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales, Rainbow decompositions, Unnamed Item, On various (strong) rainbow connection numbers of graphs, Catalan fragile words, On the connectedness of the complement of the zero-divisor graph of a poset, There are exactly five biplanes with k = 11, Gram matrices of reproducing kernel Hilbert spaces over graphs IV. (Quadratic inequalities for graph Laplacians), Degree resistance distance of trees with some given parameters, A New Proof of Foster’s First Theorem, Local Properties via Color Energy Graphs and Forbidden Configurations, Identities for minors of the Laplacian, resistance and distance matrices of graphs with arbitrary weights, On the Convergence Time of a Natural Dynamics for Linear Programming, Spanning triangulations in graphs, On the threshold problem for Latin boxes, Robust partial synchronization of delay-coupled networks, A new bound for the Erdős distinct distances problem in the plane over prime fields, Consensus in first order nonlinear heterogeneous multi-agent systems with event-based sliding mode control, Exponential sum estimates over prime fields, Associate Submersions and Qualitative Properties of Nonlinear Circuits with Implicit Characteristics, Hybrid online learning control in networked multiagent systems: A survey, Graph automaton groups, A General Framework for Graph Sparsification, Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs, Unnamed Item, Optimal threshold for a random graph to be 2-universal, Random Walks, Electric Networks and The Transience Class problem of Sandpiles, Unnamed Item, Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers, Flow Polytopes and the Space of Diagonal Harmonics, Unnamed Item, Homomorphisms of Trees into a Path, Ramsey Numbers Involving Large Books, An Introduction to Temporal Graphs: An Algorithmic Perspective*, Identifying vortical network connectors for turbulent flow modification, Additive derivations of incidence algebras, Reappraising the distribution of the number of edge crossings of graphs on a sphere, Large Book-Cycle Ramsey Numbers, Bounds of the sum of edge lengths in linear arrangements of trees, Hamiltonian walks on the Sierpinski gasket, The hitting time of random walk on unicyclic graphs, Unnamed Item, A dynamic model of power metal-oxide-semiconductor field-effect transistor half-bridges for the fast simulation of switching induced electromagnetic emissions, Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k, On the Strictness of a Bound for the Diameter of Cayley Graphs Generated by Transposition Trees, Anderson transition on the Bethe lattice: an approach with real energies, Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus, Bootstrap percolation via automated conjecturing, Joint Alignment from Pairwise Differences with a Noisy Oracle, Efficient Point-to-Point Resistance Distance Queries in Large Graphs, Disjointness graphs of segments in the space, Classes of graphs embeddable in order-dependent surfaces, Extending the Tutte and Bollobás–Riordan polynomials to rank 3 weakly coloured stranded graphs, Improved lower bound for the list chromatic number of graphs with no Kt minor, Strengthening Rödl's theorem, Friendly bisections of random graphs, A branching process approach to level‐k phylogenetic networks, Diameter and connectivity of finite simple graphs, Arithmetic Dijkgraaf-Witten invariants for real quadratic fields, quadratic residue graphs, and density formulas, Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs, On supersaturation and stability for generalized Turán problems, The solvability of consensus in iterated models extended with safe-consensus, The fresh-graph of a nominal set, On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs, Min‐sum controllable risk problems with concave risk functions of the same value range, The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings, Large simple \(d\)-cycles in simplicial complexes, Optimal Estimation of the Number of Network Communities, A simple proof for the lower bound of the girth of graphs \(D(n,q)\), Generalized inverses in graph theory, Parameter estimation in a 3‐parameter p‐star random graph model, Coloring in graphs of twist knots, Distance distributions and inverse problems for metric measure spaces, An \(A_\alpha\)-spectral Erdős-Pósa theorem, Stationary solutions of discrete Landau-de Gennes theory: \(3 \times 3\) Q-tensor case, On \(A_{\alpha}\) spectral extrema of graphs forbidding even cycles, On the centrality analysis of covert networks using games with externalities, Deletion-contraction and the surface Tutte polynomial, Some results on matrices with respect to resistance distance, Metric enrichment, finite generation, and the path coreflection, Ramsey numbers of large even cycles and fans, Subgraphs of large connectivity and chromatic number, 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable, Determinant of the finite volume Laplacian, Statistics of Feynman amplitudes in \(\phi^4\)-theory, On the eigenvalues of the graphs \(D(5,q)\), Stability, vertex stability, and unfrozenness for special graph classes, Structural controllability and observability of complex network with output feedback, Polynomial invariants for cactuses, A Torelli theorem for graph isomorphisms, Dichromatic polynomial for graph of a \((2, n)\)-torus knot, An Ambarzumian-type theorem on graphs with odd cycles, On the coexistence of competing languages, Recoverable formal language, The Tutte polynomial of a class of compound graphs and its applications, Bargaining for assembly, Percolation of arbitrary uncorrelated nested subgraphs, On two conjectures concerning spanning tree edge dependences of graphs, Two-dimensional ferronematics, canonical harmonic maps and minimal connections, Subgraph of unitary Cayley graph of matrix algebras induced by idempotent matrices, Tensor decompositions on simplicial complexes with invariance, Asymptotic bounds for clustering problems in random graphs, An \(A_{\alpha}\)-spectral Erdős-Sós theorem, Unnamed Item, Symmetry in complex networks, Complexity of Stability., An Ore-type condition for arbitrarily vertex decomposable graphs, Boundary of Hurwitz spaces and explicit patching, Near-perfect clique-factors in sparse pseudorandom graphs, Exact Potts model partition functions on strips of the honeycomb lattice, Exact Potts model partition functions on wider arbitrary-length strips of the square lattice, Communication in the two-way listen-in vertex-disjoint paths mode, Conjugacy relation on Coxeter elements, The complexity of arc-colorings for directed hypergraphs, Zeros of Jones polynomials for families of knots and links, Acyclic orientations and the chromatic polynomial, On the inducibility of cycles, On bubble generators in directed graphs, Frozen development in graph coloring, The cut metric, random graphs, and branching processes, Subtraction-free complexity, cluster transformations, and spanning trees, Maxima of the \(Q\)-index: graphs with no \(K_{s,t}\), Stable divisorial gonality is in NP, Decomposing split graphs into locally irregular graphs, Spanning tree generating functions for infinite periodic graphs L and connections with simple closed random walks on L
