scientific article; zbMATH DE number 854567
From MaRDI portal
Publication:4869540
zbMATH Open0845.05001MaRDI QIDQ4869540FDOQ4869540
Recommendations
Cited in
(only showing first 100 items - show all)- Enumerating super edge-magic labelings for the union of nonisomorphic graphs
- THE DIAMETER AND RADIUS OF RADIALLY MAXIMAL GRAPHS
- Graph polynomials
- Minimum Cost Homomorphisms to Reflexive Digraphs
- Eternal and Secure Domination in Graphs
- Some results on the index of unicyclic graphs
- On certain aspects of topological indices
- The maximum girth and minimum circumference of graphs with prescribed radius and diameter
- A graph-theoretic approach to stability of neutral stochastic coupled oscillators network with time-varying delayed coupling
- Recognizing balanceable matrices
- The \(k\)-generalized Hermitian adjacency matrices for mixed graphs
- On super edge-antimagic total labeling of subdivided stars
- Even cycles in hypergraphs
- Forests and trees among Gallai graphs
- On edge-disjoint pairs of matchings
- Long cycles in graphs without Hamiltonian paths
- Level of repair analysis and minimum cost homomorphisms of graphs
- Vertex-coloring 3-edge-weighting of some graphs
- Edge-disjoint spanners in tori
- Flows on flow-admissible signed graphs
- On input-to-state stability for stochastic coupled control systems on networks
- Hermitian adjacency matrix of the second kind for mixed graphs
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
- The complexity of the locally connected spanning tree problem
- A graph-theoretic approach to boundedness of stochastic Cohen-Grossberg neural networks with Markovian switching
- The game of arboricity
- Perfect, ideal and balanced matrices
- (Di)graph products, labelings and related results
- Channel assignment on graphs of bounded treewidth
- Vertex-vertex color energy of a graph
- scientific article; zbMATH DE number 7725444 (Why is no real title available?)
- scientific article; zbMATH DE number 7637228 (Why is no real title available?)
- scientific article; zbMATH DE number 7008238 (Why is no real title available?)
- On super \((a,d)\)-edge-antimagic total labeling of disconnected graphs
- Graphs whose edge set can be partitioned into maximum matchings
- On the algorithmic complexity of zero-sum edge-coloring
- Supra-hereditary properties of hypergraphs
- Simple proofs of results on paths representing all colors in proper vertex-colorings
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
- The circular chromatic number of hypergraphs
- A generalization of the problem of Mariusz Meszka
- The \(a\) and \((a, b)\)-analogs of Zagreb indices and coindices of graphs
- On the strong chromatic index of sparse graphs
- A generalization of interval edge-colorings of graphs
- On the automorphic chromatic index of a graph
- Smallest maximal matchings of graphs
- Constant tolerance intersection graphs of subtrees of a tree
- Equipartite polytopes
- On the resurgence and asymptotic resurgence of homogeneous ideals
- The hyper-zagreb index for an infinite family of nanostar dendrimer
- The third and hyper-Zagreb coindices of some graph operations
- Percolation on complex networks: theory and application
- Weakly perfect graphs arising from rings
- Center of Cartesian and strong product of digraphs
- The \((K, k)\)-capacitated spanning tree problem
- Upper domatic number of regular graphs
- From modal logic to terminal coalgebras
- A characterization of claw-free CIS graphs and new results on the order of CIS graphs
- The minimum semidefinite rank of a triangle-free graph
- Distance-based topological indices and double graph
- On upper bounds for parameters related to the construction of special maximum matchings
- Isolation of the diamond graph
- The existence of \((2 \times c, \lambda )\) grid-block designs with \({c\in \{3, 4, 5\}}\) and \(\lambda \geq 1\)
- Online graph coloring against a randomized adversary
- On a poset of trees revisited
- The structure of information networks
- Boundedness for network of stochastic coupled Van der Pol oscillators with time-varying delayed coupling
- A proof of the Kauffman-Harary conjecture
- Verifiable broadcasting and gossiping in communication networks
- On the associated graphs to a commutative ring
- On complexity of special maximum matchings constructing
- On the complexity of deciding whether the regular number is at most two
- Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph
- Extremal properties of the bipartite vertex frustration of graphs
- The bipartite edge frustration of graphs under subdivided edges and their related sums
- Characterizing minimal point set dominating sets
- Algorithmic complexity of weakly semiregular partitioning and the representation number
- Values and bounds for depth and Stanley depth of some classes of edge ideals
- On the enhanced power graph of a finite group
- On the largest eigenvalues of bipartite graphs which are nearly complete
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- Generalizing \(D\)-graphs
- Stability analysis of stochastic coupled systems on networks without strong connectedness via hierarchical approach
- Peg solitaire on graphs
- On the structure of Hamiltonian cycles in Cayley graphs of finite quotients of the modular group
- On the bipartite vertex frustration of graphs
- Scheduling to minimize gaps and power consumption
- Embedding a subclass of trees into hypercubes
- On the complexity of the identifiable subgraph problem, revisited
- Three ways to cover a graph
- On consecutive edge magic total labelings of connected bipartite graphs
- Equipartite graphs
- Additive approximation for edge-deletion problems
- A robber locating strategy for trees
- Optimization architecture for joint multi-path routing and scheduling in wireless mesh networks
- On the index of caterpillars
- Constructing homomorphism spaces and endomorphism rings.
- Minimum number of below average triangles in a weighted complete graph
- Optimal identifying codes in cycles and paths
- Induced-universal graphs for graphs with bounded maximum degree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4869540)
