scientific article; zbMATH DE number 854567
From MaRDI portal
Publication:4869540
zbMath0845.05001MaRDI QIDQ4869540
Publication date: 11 March 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items
Stochastic monotonicity and realizable monotonicity, Uniquely 2-list colorable graphs, On claw-free asteroidal triple-free graphs, Partition of \(\pi \)-electrons among the faces of polyhedral carbon clusters, Problems and algorithms for covering arrays, Embeddings of maximum packings in triple systems, Enumerative aspects of secondary structures, A new method optimizing the subgraph centrality of large networks, The relationship between carbon dioxide emission and economic growth: hierarchical structure methods, Complexity of learning in concept lattices from positive and negative examples, Asymptotic behavior of stochastic multi-group epidemic models with distributed delays, Packing coloring of Sierpiński-type graphs, Synchronized stationary distribution of hybrid stochastic coupled systems with applications to coupled oscillators and a Chua's circuits network, Some extremal families of edge-regular graphs, On Cartesian product of Euclidean distance matrices, Shortest circuit covers of signed graphs, Stabilization of stochastic complex-valued coupled delayed systems with Markovian switching via periodically intermittent control, Structure connectivity of hypercubes, Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II, A note on co-maximal graphs of commutative rings, Packing chromatic number versus chromatic and clique number, On the strong chromatic index of sparse graphs, The existence and global exponential stability of periodic solution for a neutral coupled system on networks with delays, The maximum girth and minimum circumference of graphs with prescribed radius and diameter, On input-to-state stability for stochastic coupled control systems on networks, Boundedness for network of stochastic coupled Van der Pol oscillators with time-varying delayed coupling, Outer synchronization of delayed coupled systems on networks without strong connectedness: a hierarchical method, The multiplex dependency structure of financial markets, Weak approach to planar soap bubble clusters, Optimal identifying codes in cycles and paths, The \((K, k)\)-capacitated spanning tree problem, Is there any polynomial upper bound for the universal labeling of graphs?, A refined algorithm for maximum independent set in degree-4 graphs, On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability, Periodic solutions of discrete time periodic time-varying coupled systems on networks, Ground states of nonlinear Schrödinger equation on star metric graphs, Linearity and complements in projective space, Extremal sparsity of the companion matrix of a polynomial, Multiple weak 2-linkage and its applications on integer flows of signed graphs, Graphs whose Szeged and Wiener numbers differ by 4 and 5, Deficiency of forests, (Di)graph products, labelings and related results, Strong resolving graphs: the realization and the characterization problems, Tree spanners of bounded degree graphs, The existence of \((2 \times c, \lambda )\) grid-block designs with \({c\in \{3, 4, 5\}}\) and \(\lambda \geq 1\), A tight lower bound for the hardness of clutters, A large set of torus obstructions and how they were discovered, Regularity of powers of bipartite graphs, Powers of geometric intersection graphs and dispersion algorithms, The stable set of associated primes of the ideal of a graph, Graphs whose edge set can be partitioned into maximum matchings, Graphs vertex-partitionable into strong cliques, Channel assignment on graphs of bounded treewidth, Three conjectures on the signed cycle domination in graphs, Periodic solutions for complex-valued neural networks of neutral type by combining graph theory with coincidence degree theory, Fast 3-coloring triangle-free planar graphs, On the relation between the positive inertia index and negative inertia index of weighted graphs, Mostar index, Hereditary dominating pair graphs, The parameterized complexity of some minimum label problems, A min-max property of chordal bipartite graphs with applications, An interlacing technique for spectra of random walks and its application to finite percolation clusters, Square-free perfect graphs., 0-centred and 0-ubiquitously graceful trees., Stability in mean of partial variables for coupled stochastic reaction-diffusion systems on networks: a graph approach, Prime power and prime product distance graphs, On maximum \(k\)-edge-colorable subgraphs of bipartite graphs, Critical vertices and edges in \(H\)-free graphs, Synchronization analysis of stochastic coupled systems with time delay on networks by periodically intermittent control and graph-theoretic method, Dynamics of a stochastic multigroup SIQR epidemic model with standard incidence rates, Genus of the hypercube graph and real moment-angle complexes, Wiener index and addressing of the total graph, Graph transformations for efficient structural analysis, A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time, The IC-indices of complete multipartite graphs, The strict-sense nonblocking multirate \(\log_d(N, 0, p)\) switching network, On edge-sets of bicliques in graphs, A note: Some results in step domination of trees, Constant tolerance intersection graphs of subtrees of a tree, Input-to-state stability for stochastic multi-group models with multi-dispersal and time-varying delay, Stability of complex-valued impulsive stochastic functional differential equations on networks with Markovian switching, Exact algorithms for maximum independent set, Antiparallel \(d\)-stable traces and a stronger version of ore problem, Even cycles in hypergraphs, On a poset of trees revisited, On SAT instance classes and a method for reliable performance experiments with SAT solvers, Cluster algebras and Weil-Petersson forms, Contraction and deletion blockers for perfect graphs and \(H\)-free graphs, Ramsey numbers for partially-ordered sets, Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications, Parameterized complexity of vertex colouring, Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains, Graph imperfection. I, On a conjecture about trees in graphs with large girth, Coloring face-hypergraphs of graphs on surfaces, Graph-theoretical properties of parallelism in the digital plane, Verifiable broadcasting and gossiping in communication networks, An efficient sorting algorithm for a sequence of kings in a tournament., Quantified computation tree logic, Gene assembly through cyclic graph decomposition, Stabilization of complex-valued stochastic functional differential systems on networks via impulsive control, Generalizations and strengthenings of Ryser's conjecture, The spectral determinations of connected multicone graphs \(K_{\mathcal{W}} \operatorname{\nabla} mCP(n)\), A new oscillator coupling function for improving the solution of graph coloring problem, Values and bounds for depth and Stanley depth of some classes of edge ideals, A characterization of claw-free CIS graphs and new results on the order of CIS graphs, Isolation of the diamond graph, The book thickness of nilpotent graphs, Mengerian temporal graphs revisited, Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected, Graph-theoretic method on the periodicity of coupled predator-prey systems with infinite delays on a dispersal network, Exponential stability of stochastic complex networks with multi-weights based on graph theory, The existence of periodic solutions for discrete-time coupled systems on networks with time-varying delay, Dynamical behavior of a stochastic multigroup SIR epidemic model, On chordal and perfect plane near-triangulations, Dynamics of a multigroup SIS epidemic model with standard incidence rates and Markovian switching, Finite-time stabilization of stochastic coupled systems on networks with Markovian switching via feedback control, Stability analysis of stochastic delayed complex networks with multi-weights based on Razumikhin technique and graph theory, Essential obstacles to Helly circular-arc graphs, Independence number of graphs and line graphs of trees by means of omega invariant, Relations between the inertia indices of a mixed graph and those of its underlying graph, Estimating the number of connected components in a graph via subgraph sampling, Additive list coloring of planar graphs with given girth, On generalized topological indices of silicon-carbon, Heuristic method to determine lucky \(k\)-polynomials for \(k\)-colorable graphs, Nonsingular (vertex-weighted) block graphs, On the multicolor size Ramsey number of stars and cliques, The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs, Bounds on \(F\)-index of tricyclic graphs with fixed pendant vertices, An application of crypto cloud computing in social networks by cooperative game theory, Existence of all generalized fractional \((g, f)\)-factors of graphs, Zero-divisor graph of a poset with respect to an automorphism, Strong Tutte type conditions and factors of graphs, Eccentricity of networks with structural constraints, Graph theory-based approach for stability analysis of stochastic coupled oscillators system by energy-based synchronization control, A clustering-based portfolio strategy incorporating momentum effect and market trend prediction, Backstepping-based decentralized tracking control for a class of interconnected stochastic nonlinear systems coupled via a directed graph, Stability analysis for complex-valued stochastic delayed networks with Markovian switching and impulsive effects, Periodically intermittent discrete observation control for synchronization of fractional-order coupled systems, Existence and global exponential stability of periodic solutions for coupled control systems on networks with feedback and time delays, The one-cop-moves game on graphs with some special structures, Positive periodic solutions of coupled singular Rayleigh systems, PBIB-designs and association schemes arising from minimum bi-connected dominating sets of hypercubes, Graph-theoretic approach to synchronization of fractional-order coupled systems with time-varying delays via periodically intermittent control, Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints, Properties of tiny braids and the associated commuting graph, Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7, Measure-theoretic bounds on the spectral radius of graphs from walks, The conjunction of the linear arboricity conjecture and Lovász's path partition theorem, Berge-Fulkerson coloring for some families of superposition snarks, Flows on flow-admissible signed graphs, Automorphism group and other properties of zero component graph over a vector space, On certain aspects of topological indices, Cohen-Macaulayness of two classes of circulant graphs, A class of graphs with a few well-covered members, Extremal digraphs avoiding an orientation of the diamond, Wiener index of a fuzzy graph and application to illegal immigration networks, On the in-out-proper orientations of graphs, Cohen-Macaulayness of a class of graphs versus the class of their complements, Algorithmic aspects of 2-secure domination in graphs, A unifying model for locally constrained spanning tree problems, Finite-time synchronization of multi-coupling stochastic fuzzy neural networks with mixed delays via feedback control, On the commuting graph of semidihedral group, Synchronization of random coupling delayed complex networks with random and adaptive coupling strength, Synchronization of stochastic multiple weighted coupled networks with Markovian switching, Note on Hedetniemi's conjecture and the Poljak-Rödl function, Saturating stable matchings, Synchronized stationary distribution for stochastic multi-links systems with Markov jump, Degree tolerant coloring of graph, On the proper arc labeling of directed graphs, Avoidable vertices and edges in graphs: existence, characterization, and applications, Dynamics of an SIR epidemic model with varying population sizes and regime switching in a two patch setting, Stochastic resonance in coupled star-networks with power-law heterogeneity, Complexity and algorithms for constant diameter augmentation problems, Z-control on dynamics of pollution-allergy model, Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks, Stability of inverter-interfaced power systems with multi-scale-free properties, The Wiener index of the zero-divisor graph of a finite commutative ring with unity, Proper distinguishing arc-colourings of symmetric digraphs, Modelling conflicting individual preference: target sequences and graph realization, Universal adjacency spectrum of the looped zero divisor graph of \(\mathbb{Z}_n\), On almost self-centered graphs and almost peripheral graphs, Examples of edge critical graphs in peg solitaire, The maximum size of a nonhamiltonian graph with given order and connectivity, On the resurgence and asymptotic resurgence of homogeneous ideals, The \(k\)-generalized Hermitian adjacency matrices for mixed graphs, On connectivities of edge-colored graphs, On the connectivity and equality of some graphs on finite semigroups, On game chromatic vertex-critical graphs, Flows of 3-edge-colorable cubic signed graphs, Peg solitaire on graphs with jumping and merging allowed, Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs, A note on a conjecture of Wu, Xu and Xu, Some extremal problems on the distance involving peripheral vertices of trees with given matching number, Hermitian adjacency matrix of the second kind for mixed graphs, Stability analysis of discrete-time multi-patch Beddington-DeAngelis type predator-prey model with time-varying delay, A graph-theoretic method to study the existence of periodic solutions for a coupled Rayleigh system via inequality techniques, On maximal det-independent (res-independent) sets in graphs, On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard, On well-covered direct products, On the complexity of the identifiable subgraph problem, revisited, Construction of cospectral integral regular graphs, One-three join: a graph operation and its consequences, A note on minimal matching covered graphs, Edge-colouring of join graphs, Characterizations of pseudo-codewords of (low-density) parity-check codes, Computing the bipartite edge frustration of fullerene graphs, Vertex-coloring 3-edge-weighting of some graphs, Upper maximal graphs of posets, Approximation and inapproximability results for maximum clique of disc graphs in high dimensions, Rings which are generated by their units: a graph theoretical approach, Additive approximation for edge-deletion problems, An upper bound on the algebraic connectivity of outerplanar graphs, Colorful edge decomposition of graphs: some polynomial cases, Dominator sequences in bipartite graphs, The \(k\)-strong induced arboricity of a graph, Stability of decentralized model predictive control of graph-based power flow systems via passivity, Minimal 2-point set dominating sets of a graph, Super \((a,d)\)-edge antimagic total labeling of a subclass of trees, Distance antimagic labeling of join and corona of two graphs, Kirchhoff index and degree Kirchhoff index of complete multipartite graphs, A robber locating strategy for trees, \(C\)-cordial labeling in signed graphs, Distance antimagic labeling of the ladder graph, Unitary Cayley meet signed graphs, On co-maximal meet signed graphs of commutative rings, Some algebraic polynomials and topological indices of generalized prism and toroidal polyhex networks, Some computational aspects of boron triangular nanotubes, Exponential synchronization of stochastic complex networks with multi-weights: a graph-theoretic approach, A general theory for target reproduction numbers with applications to ecology and epidemiology, Inverting the Turán problem, Regularity of binomial edge ideals of certain block graphs, Minimal webs in Riemannian manifolds, A dichotomy for minimum cost graph homomorphisms, Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs, Scheduling to minimize gaps and power consumption, Global exponential stability for stochastic coupled systems on networks with Markovian switching, Metric or partial metric spaces endowed with a finite number of graphs: a tool to obtain fixed point results, On the adjacency matrix of a threshold graph, Stability number and \(f\)-factors in graphs, Circumference of a graph and its distance dominating longest cycles, Minimal graphs with respect to geometric distance realizability, The complexity of the proper orientation number, Bandwidth consecutive multicolorings of graphs, Zombie number of the Cartesian product of graphs, Labeling constructions using digraph products, A positivity phenomenon in Elser's Gaussian-cluster percolation model, Distance measurements related to Cartesian product of cycles, Reconstruction and verification of chordal graphs with a distance oracle, Percolation on complex networks: theory and application, On trees with unique locating kernels, Vertex-vertex color energy of a graph, Confluence number of certain derivative graphs, Edge-disjoint branchings in temporal digraphs, Coloring temporal graphs, Possible cardinalities of the center of a graph, Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction, Face antimagic labeling of Jahangir graph, Atom-bond connectivity index of quasi-tree graphs, On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs, Minimum \(k\)-path vertex cover, Some inequalities for the atom-Bond connectivity index of graph operations, A refinement of choosability of graphs, Periodic solutions for discrete-time Cohen-Grossberg neural networks with delays, Dynamics of a multigroup SIRS epidemic model with random perturbations and varying total population size, On graph fall-coloring: existence and constructions, The largest graphs with given order and diameter: a simple proof, A combinatorial characterization of finite groups of prime exponent, Stability of multi-group models with cross-dispersal based on graph theory, Weighted input to state stability for delay coupled systems on networks, Stability analysis for stochastic complex-valued delayed networks with multiple nonlinear links and impulsive effects, Volume computation for sparse Boolean quadric relaxations, Strict-sense nonblocking conditions for the \(\log_2 N - 1\) multirate switching fabric for the discrete bandwidth model, Global exponential stability for coupled retarded systems on networks: a graph-theoretic approach, Chromatic number of the cyclic graph of infinite semigroup, Normal 6-edge-colorings of some bridgeless cubic graphs, Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor, Intermittent control to stationary distribution and exponential stability for hybrid multi-stochastic-weight coupled networks based on aperiodicity, Dynamics of a multigroup SIR epidemic model with nonlinear incidence and stochastic perturbation, Graph-theoretic approach to synchronizing delayed coupled systems on networks via periodically intermittent control, Clique-factors in sparse pseudorandom graphs, The parameterized complexity of the minimum shared edges problem, Are induction and well-ordering equivalent?, Commuting decomposition of \(K_{n_1,n_2,\dots,n_k}\) through realization of the product \(A(G)A\left(G^P_k\right)\), Planar Ramsey graphs, Stabilization of stochastic delayed networks with Markovian switching and hybrid nonlinear coupling via aperiodically intermittent control, New results on stability of random coupled systems on networks with Markovian switching, Packing and domination parameters in digraphs, New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs, Quantized feedback control scheme on coupled systems with time delay and distributed delay: a finite-time inner synchronization analysis, General transmission lemma and Wiener complexity of triangular grids, Quantitative aspects of acyclicity, Enumerating colorings, tensions and flows in cell complexes, Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs, A note on some fundamental results in complete gauge spaces and application, On \(\bullet\)-line signed graphs \(L_\bullet(S)\), Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs, The optimal capture time of the one-cop-moves game, Standard examples as subposets of posets., Classification of rings with unit graphs having domination number less than four, Linear-size planar Manhattan network for convex point sets, Coloring problems on bipartite graphs of small diameter, Linearly independent vertices and minimum semidefinite rank, Finding more perfect matchings in leapfrog fullerenes, Induced-universal graphs for graphs with bounded maximum degree, The structure of information networks, Hamilton cycles in digraphs of unitary matrices, Edge-antimagic graphs, Dot product representations of graphs, Simple proofs of results on paths representing all colors in proper vertex-colorings, Super-edge-graceful labelings of some cubic graphs, On super edge-antimagicness of subdivided stars, Domination game critical graphs, Stability analysis for discrete-time coupled systems with multi-diffusion by graph-theoretic approach and its application, Physical network design to facilitate capacity reallocation, On a symmetric representation of Hermitian matrices and its applications to graph theory, Super \((a, d)\)-EAT labeling of subdivided stars, Improved parameterized and exact algorithms for cut problems on trees, An exact algorithm for maximum independent set in degree-5 graphs, On super edge-antimagicness of circulant graphs, Motion tracking as a constrained optimization problem., Amalgamations of connected \(k\)-factorizations., Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs, Synchronizing finite automata on Eulerian digraphs., Ordered Ramsey numbers of loose paths and matchings, Three ways to cover a graph, Langford sequences and a product of digraphs, A class of perfect graphs containing \(P_{6}\), The complexity of the locally connected spanning tree problem, Distance and connectivity measures in permutation graphs, Global exponential stability for stochastic networks of coupled oscillators with variable delay, The structure of (\(t,r\))-regular graphs of large order, A note on the bounded fragmentation property and its applications in network reliability, Saturation number of fullerene graphs, Leapfrog fullerenes have many perfect matchings, Maximum number of fixed points in regulatory Boolean networks, On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs, Edge-colorings avoiding rainbow and monochromatic subgraphs, Orienting Cayley graphs generated by transposition trees, Patterns of simple gene assembly in ciliates, Spectral characterization of the Hamming graphs, On complexity of special maximum matchings constructing, Polarity of chordal graphs, Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number, Composition of stable set polyhedra, Decision problem for shuffled genes, Triangle-free graphs whose independence number equals the degree, A forbidden subgraph characterization of line-polar bipartite graphs, Determining sets, resolving sets, and the exchange property, Regularity, depth and arithmetic rank of bipartite edge ideals, Interval edge-colorings of complete graphs and \(n\)-dimensional cubes, On disjoint matchings in cubic graphs, On Kramer-Mesner matrix partitioning conjecture, On the Szeged and the Laplacian Szeged spectrum of a graph, An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem, The bipartite edge frustration of extension of splice and link graphs, Reversed resolution in reducing general satisfiability problem, Characterization of signed graphs whose iterated signed line graphs are balanced or \(S\)-consistent, Triangle decompositions of planar graphs, Every graph \(G\) is Hall \(\Delta(G)\)-extendible, Connectivity, stability and efficiency in a network as an information flow, Long cycles in graphs without Hamiltonian paths, On edge-disjoint pairs of matchings, On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs, Equipartite graphs, The total graph and regular graph of a commutative ring, Graph theoretic approach to parallel gene assembly, 2-piercings via graph theory, Strong structural properties of unidirectional star graphs, Hamiltonian connectivity of 2-tree-generated networks, Solving partition problems with colour-bipartitions, A note on cyclic connectivity and matching properties of regular graphs, Characterization of a class of graphs related to pairs of disjoint matchings, Intersection graphs of \(S\)-acts, The undirected power graph of a finite group., On the acyclic chromatic number of Hamming graphs, Approximation algorithms for maximum latency and partial cycle cover, Combinatorial designs and the theorem of Weil on multiplicative character sums, On zero-sum partitions and anti-magic trees, Edge-disjoint spanners in tori, Edge searching weighted graphs, On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group, Forbidden pairs for \(k\)-connected Hamiltonian graphs, Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms, A proof of the Kauffman-Harary conjecture, 2-cnfs and logical embeddings, Computational study on planar dominating set problem, Monomial bases for broken circuit complexes, Graphs with restricted valency and matching number, Polychromatic colorings of rectangular partitions, On the largest eigenvalues of bipartite graphs which are nearly complete, On super \((a,d)\)-edge-antimagic total labeling of disconnected graphs, The fractional chromatic number, the Hall ratio, and the lexicographic product, Multicolored parallelisms of Hamiltonian cycles, The circular chromatic number of hypergraphs, Global-stability problem for coupled systems of differential equations on networks, On the local distinguishing numbers of cycles, Hamiltonian powers in threshold and arborescent comparability graphs, 9-connected claw-free graphs are Hamilton-connected, Laplacian graph eigenvectors, On approximating tree spanners that are breadth first search trees, On the ordered list subgraph embedding problems, Sharp lower bounds on the Narumi-Katayama index of graph operations, The bipartite edge frustration of hierarchical product of graphs, Distributed stopping for average consensus in undirected graphs via event-triggered strategies, Uniquely tree-saturated graphs, A cyclic solution for an infinite class of Hamilton-Waterloo problems, Steiner tree problem with minimum number of Steiner points and bounded edge-length, Interval edge-colorings of complete graphs, Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles, I,F-partitions of sparse graphs, Vertex-distinguishing proper arc colorings of digraphs, Normal matrices subordinate to a tree and flat portions of the field of values, Qualitative behavior of a smoking model, Stochastic stability for pantograph multi-group models with dispersal and stochastic perturbation, The label cut problem with respect to path length and label frequency, Strong Allee effect in a stochastic logistic model with mate limitation and stochastic immigration, On graphs whose graphoidal domination number is one, On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques, On \((k,d)\)-Skolem graceful graphs, Global 2-point set domination number of a graph, Domination in graphoidally covered graphs: least-kernel graphoidal covers, Barrel pseudotilings, Some new perspectives on global domination in graphs, On the location of roots of independence polynomials, Constructing homomorphism spaces and endomorphism rings., On super \((a, d)\)-edge-antimagic total labeling of special types of crown graphs, The existence of \((K_2\times K_6)\)-designs, The Zagreb coindices of graph operations, Recognizing line-polar bipartite graphs in time \(O(n)\), A generalization of interval edge-colorings of graphs, On the automorphic chromatic index of a graph, Extending the type reproduction number to infectious disease control targeting contacts between types, Equipartite polytopes, The bipartite edge frustration of composite graphs, General graph pebbling, Characterization of common-edge sigraph, Finite prime distance graphs and 2-odd graphs, Algorithmic complexity of proper labeling problems, Fast-mixed searching and related problems on graphs, A new result on the problem of Buratti, Horak and Rosa, Lattices, whose incomparability graphs have horns, On the size of 3-uniform linear hypergraphs, Interval edge-colorings of \(K_{1, m, n}\), On the Buratti-Horak-Rosa conjecture about Hamiltonian paths in complete graphs, Analysis of autonomous Lotka-Volterra competition systems with random perturbation, Super \(d\)-antimagic labelings of disconnected plane graphs, Lexicographic products with high reconstruction numbers, Combinatorics on update digraphs in Boolean networks, Global stability analysis for stochastic coupled systems on networks, The minimum semidefinite rank of a triangle-free graph, Super restricted edge connectivity of regular edge-transitive graphs, Fast edge searching and fast searching on graphs, Edge-disjoint spanning trees and eigenvalues of regular graphs, Bounds on the coefficients of tension and flow polynomials, Stochastically asymptotically stability of the multi-group SEIR and SIR models with random perturbation, Global stability of coupled nonlinear systems with Markovian switching, On the complexity and algorithm of grooming regular traffic in WDM optical networks, Optimization architecture for joint multi-path routing and scheduling in wireless mesh networks, Multicut in trees viewed through the eyes of vertex cover, Endpoint extendable paths in dense graphs, Peg solitaire on graphs, On the differences between Szeged and Wiener indices of graphs, Dynamics of a multigroup SIR epidemic model with stochastic perturbation, On resistance of graphs, Graph polynomials, Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs, Generalization of Erdős-Gallai edge bound, The bipartite edge frustration of graphs under subdivided edges and their related sums, Spanning closed walks and TSP in 3-connected planar graphs, Extremal properties of the bipartite vertex frustration of graphs, On super edge-antimagic total labeling of subdivided stars, Graph-theoretic method on exponential synchronization of stochastic coupled networks with Markovian switching, Forests and trees among Gallai graphs, On the induced matching problem, Kotzig frames and circuit double covers, On upper bounds for parameters related to the construction of special maximum matchings, The power of digraph products applied to labelings, Spanning trees: A survey, The complexity of the zero-sum 3-flows, Upper bounds on the \(k\)-forcing number of a graph, Graph-theoretic approach to stability of multi-group models with dispersal, The \(a\) and \((a, b)\)-analogs of Zagreb indices and coindices of graphs, Non-minimal degree-sequence-forcing triples, On the complexity of deciding whether the regular number is at most two, Characterizing minimal point set dominating sets, Stability analysis of stochastic coupled systems on networks without strong connectedness via hierarchical approach, On the bipartite vertex frustration of graphs, On consecutive edge magic total labelings of connected bipartite graphs, Algorithmic complexity of weakly semiregular partitioning and the representation number, Supra-hereditary properties of hypergraphs, Embedding a subclass of trees into hypercubes, Combinatorial Green's function of a graph and applications to networks, Characterization of networks supporting multi-dimensional linear interval routing schemes, A fully benzenoid system has a unique maximum cardinality resonant set, Universal cycles of classes of restricted words, Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number, Global stability for discrete Cohen-Grossberg neural networks with finite and infinite delays, A note on the intersection property for flat boxes and boxicity in \(\mathbb R^d\), An algorithm for computing cutpoints in finite metric spaces, A NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS, The upper domatic number of powers of graphs, On some leap indices of Polycyclic Aromatic Hydrocarbons (PAHs), Some properties of intersection graph of a module with an application of the graph of ℤn, On (a, d)-SEAT labeling of forests of subdivided stars, M-polynomial based topological properties of Sudoku graphs, On leap indices of CNCk[n by using line operator on its subdivision], On the M-polynomials and degree-based topological indices of an important class of graphs, A note on the k-tuple domination number of graphs, A large class of graphs with a small subclass of Cohen–Macaulay members, Fantasy on a Baseball Seam, Exploring Combinatorics and Graph Theory with Simple Blokus, RSEMT labeling of union of paths and subdivided star, Super magic deficiency of graphs, Minimum entropy production, detailed balance and Wasserstein distance for continuous-time Markov processes, Upper domatic number of regular graphs, A note on the neighbour-distinguishing index of digraphs, A note on pebbling bound for a product of Class 0 graphs, On multi-symmetric functions and transportation polytopes, Unnamed Item, Von Neumann regular graphs associated with rings, Snakes: Legal, Illegal and Dodecahedral, Unitary Addition Cayley Ring Signed Graphs *, An Algorithmic Characterization of sigraphs whose second iterated line sigraphs and common-edge sigraphs are switching equivalent, On the vertex covering sets and vertex cover polynomials of square of ladder graph, The hyper-zagreb index for an infinite family of nanostar dendrimer, Negation switching invariant 3-Path signed graphs, Word-Representable Graphs: a Survey, Novel aperiodically intermittent stability criteria for Markovian switching stochastic delayed coupled systems, Discrete-time distributed Kalman filter design for networks of interconnected systems with linear time-varying dynamics, Unnamed Item, Universal adjacency spectrum of zero divisor graph on the ring and its complement, Unitary Cayley graphs whose Roman domination numbers are at most four, THE ADJACENCY GRAPH DETERMINED BY A GIVEN HYPERGRAPH, Embedding of sign-regular signed graphs and its spectral analysis, Synchronization of coupled stochastic complex-valued dynamical networks with time-varying delays via aperiodically intermittent adaptive control, The relation between the number of leaves of a tree and its diameter, Wiener index of graphs with fixed number of pendant or cut-vertices, Powers of cycle graph which are k-self complementary and k-co-self complementary, Stabilization of Stochastic Coupled Systems With Time Delay Via Feedback Control Based on Discrete‐Time State Observations, Optimization over Degree Sequences, Truly non-trivial graphoidal graphs, TWO RESULTS ON THE PALETTE INDEX OF GRAPHS, LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS, INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES, DETERMINISTIC AND STOCHASTIC ANALYSIS OF A COVID-19 SPREAD MODEL, Algorithm to check the existence of H for a given G such that A(G)A(H) is graphical, Transitivity of trees, Computation of the fifth Geometric-Arithmetic Index for Polycyclic Aromatic Hydrocarbons PAH k , Unnamed Item, ON SOME TOTAL GRAPHS ON FINITE RINGS, Unnamed Item, Unnamed Item, Co-maximal signed graphs of commutative rings, A note on the Alexander dual of path ideals of rooted trees, Graphic Sequences Have Realizations Containing Bisections of Large Degree, A STRUCTURAL APPROACH TO THE REPRESENTATION OF LIFE HISTORY DATA1, Unnamed Item, Bounds for the pebbling number of product graphs, INTERSECTION GRAPH OF A MODULE, Unnamed Item, WEAKLY PERFECT GRAPHS ARISING FROM RINGS, Unnamed Item, Invertibility of graph translation and support of Laplacian Fiedler vectors, Unnamed Item, Complexity of Roman {2}-domination and the double Roman domination in graphs, Global Stability Analysis Through Graph Theory for Smartphone Usage During COVID-19 Pandemic, Modular irregularity strength of graphs, Multi-switch: A tool for finding potential edge-disjoint 1-factors, THE DIAMETER AND RADIUS OF RADIALLY MAXIMAL GRAPHS, Brouwer type conjecture for the eigenvalues of distance signless Laplacian matrix of a graph, Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph, Graph-Theoretic Approach to Exponential Stability of Delayed Coupled Systems on Networks under Periodically Intermittent Control, Distance-Based Topological Indices and Double graph, Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph, Packing trees of unbounded degrees in random graphs, Symbolic powers of vertex cover ideals, On Sylvester Colorings of Cubic Graphs, Extremal unicyclic graphs with respect to the Sanskruti index, Dynamics of a multigroup SIQS epidemic model under regime switching, On 2-rainbow domination number of functigraph and its complement, On the minimum degree of the power graph of a finite cyclic group, Computational Classification of Tubular Algebras, Unnamed Item, Unnamed Item, Unnamed Item, A note on integral non-commuting graphs, On graphoidal length of a tree in terms of its diameter, Interval edge-coloring: A model of curriculum scheduling, Inner synchronisation of stochastic impulsive multi-links coupled systems via discrete-time state observations control, Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure, Network information flow, Graphoidally independent infinite graphs, On the Structure of the Commuting Graph of Brandt Semigroups, Global exponential stability of multi-group models with multiple dispersal and stochastic perturbation based on graph-theoretic approach, A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations, List-antimagic labeling of vertex-weighted graphs, New Results on Chromatic Polynomials, On ideal sumset labelled graphs, Maximal matchings in polyspiro and benzenoid chains, Unnamed Item, ON THE ASSOCIATED GRAPHS TO A COMMUTATIVE RING, The number of Latin squares of order 11, Painting squares in \(\Delta^2-1\) shades, On injective chromatic polynomials of graphs, ENUMERATING SUPER EDGE-MAGIC LABELINGS FOR THE UNION OF NONISOMORPHIC GRAPHS, On the algorithmic complexity of zero-sum edge-coloring, Circumferences of k-connected graphs involving independence numbers, List coloring triangle-free hypergraphs, Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem, Online Graph Coloring Against a Randomized Adversary, The third and hyper-Zagreb coindices of some graph operations, The Graovac-Pisanski index of armchair tubulenes, Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions, Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars, Constructing Graphs with No Immersion of Large Complete Graphs, On generalisations of the AVD conjecture to digraphs, Induced Ramsey number for a star versus a fixed graph, Maximum nullity and zero forcing of circulant graphs, On the semi-proper orientations of graphs, Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs, Fully distributed consensus control for a class of disturbed second-order multi-agent systems with directed networks, Global stability analysis of discrete-time coupled systems on networks and its applications, Strategies for generating tree spanners: algorithms, heuristics and optimal graph classes, Graphs with $\chi=\Delta$ Have Big Cliques, The maximum degree of a minimally Hamiltonian-connected graph, \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms, Connectedness of graphs arising from the dual Steenrod algebra, Links, bridge number, and width trees, Componentwise linearity of powers of cover ideals, Eulerian walks in temporal graphs, On the generalized Helly property of hypergraphs, cliques, and bicliques, Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques, A characterization of two-dimensional Buchsbaum matching complexes, Aperiodically intermittent-based filtering in sensor networks, Certain properties of the enhanced power graph associated with a finite group, A simple proof of Ore's theorem on the maximum size of \(k\)-connected graphs with given order and diameter, Constructions of DNA and polypeptide cages based on plane graphs and odd crossing \(\pi \)-junctions, Global dynamics of a multistage SIR model with distributed delays and nonlinear incidence rate, FLIPPING LETTERS TO MINIMIZE THE SUPPORT OF A STRING, On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs, The Carathéodory number of the \(P_3\) convexity of chordal graphs, Freely solvable graphs in peg solitaire, Walks and cycles on a digraph with application to population dynamics, Heuristic algorithm for finding the maximum independent set, A graph-theoretic approach to boundedness of stochastic Cohen-Grossberg neural networks with Markovian switching, Super vertex mean labeling of cycles through different ways, An exact algorithm for the minimum dominating clique problem, Maximum determinant of (0,1) matrices with certain constant row and column sums, Local approximation of Markov chains in time and space, Generalizing \(D\)-graphs, Modelling and control of cholera on networks with a common water source, Minimum number of below average triangles in a weighted complete graph, On the minimum load coloring problem, Vertex-graceful graphs, On the index of caterpillars, Unique Perfect Phylogeny Is NP-Hard, Bertrand's postulate, the prime number theorem and product anti-magic graphs, The game of arboricity, Level of repair analysis and minimum cost homomorphisms of graphs, Even-hole-free graphs part I: Decomposition theorem, Bipartite bihypergraphs: a survey and new results, Some results on the index of unicyclic graphs, Acyclically pushable bipartite permutation digraphs: an algorithm, Polyspherical coordinate systems on orbit spaces with applications to biomolecular shape, Some basic properties of multiple Hamiltonian covers, Linearly many faults in 2-tree-generated networks, Some Distance Antimagic Labeled Graphs, A note on total colourings of digraphs, Generalized edge-colorings of weighted graphs, Remarks on the Wiener index of unicyclic graphs, LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K7, On super edge-antimagic total labelings of \(mK_n\), The existence of periodic solutions for coupled pantograph Rayleigh system, Graph operations of Randic index, Embedding hypercubes, rings, and odd graphs into hyper-stars, Eternal and Secure Domination in Graphs, Polychromatic colorings of bounded degree plane graphs, Precoloring extension forK4-minor-free graphs, SUCCESSFUL ELEMENTARY GENE ASSEMBLY STRATEGIES, Exotic equilibria of Harary graphs and a new minimum degree lower bound for synchronization, ON THE MAXIMUM NUMBER OF PERIOD ANNULI FOR SECOND ORDER CONSERVATIVE EQUATIONS, Global vertex-edge domination chain and its characterization, On the Independence Number of Graphs with Maximum Degree 3, Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions, On relative length of longest paths and cycles, Verifying the independence of partitions of a probability space, Graphs of odd girth 7 with large degree, Chromatic-index-critical graphs of orders 13 and 14, A Decomposition Theorem for Chordal Graphs and its Applications, Function simulation, graph grammars and colourings, Unique list-colourability and the fixing chromatic number of graphs, On an interpolation property of outerplanar graphs, A note about shortest cycle covers, Recognizing balanceable matrices, On graphs whose domination numbers equal their independent domination numbers, A New Characterisation of Connected Hypergraphs, Parameters of connectivity in ()-linear graphs, Counting Hamiltonian cycles in bipartite graphs, THE THIRD VERSION OF ZAGREB INDEX, Weak dynamic coloring of planar graphs, Approximation algorithms for drone delivery scheduling with a fixed number of drones, Some sufficient conditions for a graph with minimum degree to be \(k\)-factor-critical, Acyclic coloring of products of digraphs, Graphs isomorphisms under edge-replacements and the family of amoebas, 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable, Saturation numbers for linear forests $P_6 + tP_2$, Graphs with the unique path property: Structure, cycles, factors, and constructions, The chromatic number of a graph with two odd holes and an odd girth, Treewidth versus clique number. II: Tree-independence number, Hardness transitions and uniqueness of acyclic colouring, Slow coloring of \(3k\)-connected graphs, Complementary proof nets for classical logic, Bounding the list color function threshold from above, Weak Cartesian properties of simplicial sets, Intersecting diametral balls induced by a geometric graph, Non-periodically intermittent exponential synchronization of fractional-order multi-links complex dynamical networks, Remarks on the largest eigenvalue of a signed graph, Exponential stabilization of stochastic complex networks with Markovian switching topologies via intermittent discrete-time state observation control, The maximum number of cliques in graphs with prescribed order, circumference and minimum degree, On 3-degree 4-chordal graphs, Characterizing signed mixed graphs with small eigenvalues, A rooted variant of Stanley's chromatic symmetric function, Complete characterization of path-factor and path-factor covered graphs via Q -index and D -index, Contagion Source Detection in Epidemic and Infodemic Outbreaks: Mathematical Analysis and Network Algorithms, On the Turán number of \(K_m \vee C_{2k-1}\), Extremal polygonal chains with respect to the Kirchhoff index, Reconstruction and edge reconstruction of triangle-free graphs, On the clique number and independence number of the cyclic graph of a semigroup, On split graphs with three or four distinct (normalized) Laplacian eigenvalues, Some notes on Randi´c index, The unitary Cayley graph of a semiring, Extended double covers and homomorphism bounds of signed graphs, Unnamed Item, Unnamed Item, Unnamed Item, INTERVAL VERTEX-COLORINGS OF CACTUS GRAPHS WITH RESTRICTIONS ON VERTICES, Some New Results on the Edge-Strength and Strength of Graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, The existence and global stability of periodic solutions to coupled oscillators, Some results on connected vertex separators, Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors, On the super graphs and reduced super graphs of some finite groups, Multiplicity of the second‐largest eigenvalue of a planar graph, Shifting paths to avoidable ones, Multithreshold multipartite graphs, Digital topological groups, Maximal generalized rank in graphical matrix spaces, Mengerian graphs: characterization and recognition, The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number, Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\), Normal subgroup based power graph of finite groups, An algebraic approach to sets defining minimal dominating sets of regular graphs, Evolutionary stability for games played on networks, The minimum Kirchhoff index of phenylene chains, Unnamed Item, Improved upper bounds on longest-path and maximal-subdivision transversals, Smallest maximal matchings of graphs, Independent 2-point set domination in graphs - II, On the cozero-divisor graphs associated to rings, Tile-based modeling of DNA self-assembly for two graph families with appended paths, The game-theoretical modelling of a dynamically evolving network: revisiting the target sequence 111, On magic distinct labellings of simple graphs, Wiener index and addressing of some finite graphs, Subspace graph topological space of graphs, Special \textit{LCD} codes from products of graphs, Pairs of disjoint matchings and related classes of graphs, Unnamed Item, Novel Lagrange sense exponential stability criteria for time-delayed stochastic Cohen–Grossberg neural networks with Markovian jump parameters: A graph-theoretic approach, Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree, Unnamed Item, Lateness Minimization in Pairwise Connectivity Restoration Problems, Signless and normalized Laplacian spectrums of the power graph and its supergraphs of certain finite groups, Polychromatic colorings of plane graphs, Palindromic products, An algorithm for generating generalized splines on graphs such as complete graphs, complete bipartite graphs and hypercubes, Input-to-state stability of multi-group stochastic coupled systems with time-varying delay, Total Induced Vertex Stress in Barbell-Like Graphs, Sphere-of-influence graphs using the sup-norm, Fan type condition and characterization of Hamiltonian graphs, A graph‐theoretic approach to stability of neutral stochastic coupled oscillators network with time‐varying delayed coupling, Integral complete multipartite graphs, From modal logic to terminal coalgebras, Perfect, ideal and balanced matrices, Levels of complexity in financial markets, Minimizing SONET Add‐Drop Multiplexers in optical UPSR networks using the minimum number of wavelengths, Efficient line broadcasting in a \(d\)-dimensional grid, Fractional matching preclusion for radix triangular mesh, Approximations for Steiner trees with minimum number of Steiner points, Augmenting trees so that every three vertices lie on a cycle, Parallelism of stable traces, Bipartite graphs of small readability, Complete solution to a conjecture of Zhang-Liu-Zhou, Multiplicative Zagreb eccentricity indices of some composite graphs, Small oriented cycle double cover of graphs, A generalization of the problem of Mariusz Meszka, Full edge-friendly index sets of complete bipartite graphs, Sufficient conditions for triangle-free graphs to be super-$λ'$, Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph, Minimum Cost Homomorphisms to Reflexive Digraphs, On Injective Colourings of Chordal Graphs, Strong vb-dominating and vb-independent sets of a graph, On the sum of the distance signless Laplacian eigenvalues of a graph and some inequalities involving them, Block allocation of a sequential resource, S_12 and P_12-colorings of cubic graphs, Unnamed Item, The validity of Tutte's 3-flow conjecture for some Cayley graphs, Associated primes of powers of edge ideals and ear decompositions of graphs, ZAGREB POLYNOMIALS AND MULTIPLE ZAGREB INDICES FOR COMB GRAPH, On the transmission-based graph topological indices, Unnamed Item, Unnamed Item, Optimal threshold for a random graph to be 2-universal, Unnamed Item, Stability of random impulsive coupled systems on networks with Markovian switching, Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs, Induced Embeddings into Hamming Graphs., Unnamed Item, Optimal Policies for Convex Symmetric Stochastic Dynamic Teams and their Mean-Field Limit, Stability of multi‐group coupled systems on networks with multi‐diffusion based on the graph‐theoretic approach, Integer Flows and Modulo Orientations of Signed Graphs, On the enhanced power graph of a finite group, FINITE-TIME SYNCHRONIZATION FOR COUPLED SYSTEMS WITH TIME DELAY AND STOCHASTIC DISTURBANCE UNDER FEEDBACK CONTROL, On enhanced power graphs of certain groups, Writhe-like invariants of alternating links, 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size, Star coloring under some graph operations, Incomparability Graphs of Lattices, The effect on Aα-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters, On the Alexander dual of the path ideals of rooted and unrooted trees, A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs, Homogeneous colourings of graphs
