scientific article; zbMATH DE number 3290993
From MaRDI portal
Publication:5572939
zbMATH Open0182.57702MaRDI QIDQ5572939FDOQ5572939
Authors: Frank Harary 
Publication date: 1969
Title of this publication is not available (Why is that?)
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)
Cited In (only showing first 100 items - show all)
- Intrinsic dimension identification via graph-theoretic methods
- Oscillations in biochemical reaction networks arising from pairs of subnetworks
- On the first-order edge tenacity of a graph
- Random walks on graphs
- On the structure of graphs with integer Sombor indices
- Sharp lower bounds on the Narumi-Katayama index of graph operations
- Coincidence of the sets of minimal and irreducible join graphs over primary structure of algebraic Bayesian networks
- A note on the metric properties of trees
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- A class of threshold and domishold graphs: Equistable and equidominating graphs
- Totally discrete explicit and semi-implicit Euler methods for a blow-up problem in several space dimensions
- Eccentric connectivity index of graphs with subdivided edges
- Generating the family of all traffic signal light cycles coordinated with pedestrian crosswalks
- On spectra of spectra
- Graph-theoretic methods for the analysis of chemical and biochemical networks. I. Multistability and oscillations in ordinary differential equation models
- Half-transitive graphs of prime-cube order
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Some perfect coloring properties of graphs
- Planarity and duality of finite and infinite graphs
- Hyperbolicity in the corona and join of graphs
- Brooks' graph-coloring theorem and the independence number
- The size Ramsey number
- k-Blocks and Ultrablocks in Graphs
- A mathematical view of weights-of-evidence, conditional independence, and logistic regression in terms of Markov random fields
- Some localization theorems on Hamiltonian circuits
- Non-ergodicity of uniform quadratic stochastic operators
- Dynamic graphs
- Deleting vertices from a 2-connected graph with preserving 2-connectedness
- Two-chord framings of spanning trees
- The tree of cuts and minimal \(k\)-connected graphs
- On \(\Sigma\) and \(\Sigma'\) labelled graphs
- Ramsey Theorems for Multiple Copies of Graphs
- On certain polytopes associated with graphs
- Über iterierte Clique-Graphen
- Restricted triangulation on circulant graphs
- Total graph of a module with respect to singular submodule
- Zagreb indices of transformation graphs and total transformation graphs
- Colour degree matrices of graphs with at most one cycle
- Approximating the maximum multiple RNA interaction problem
- Flows and generalized coloring theorems in graphs
- On finite Sylow tower and σ-tower groups
- Structural information content of networks: graph entropy based on local vertex functionals
- Probabilistic inequalities for evaluating structural network measures
- Graph-theoretic design and analysis of key predistribution schemes
- Qualitative behavior of a smoking model
- Perfect necklaces
- The core of games on convex geometries
- Hamiltonian-connected tournaments
- Path Ramsey numbers in multicolorings
- An introduction to matching polynomials
- Degrees and matchings
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Dominating cliques in graphs
- Constant sum partition of sets of integers and distance magic graphs
- What is the difference between the domination and independent domination numbers of a cubic graph?
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- On the use of ordered sets in problems of comparison and consensus of classifications
- A computational approach to construct a multivariate complete graph invariant
- The book thickness of a graph
- Approximations of acyclic graphs
- Designing networks with compact routing tables
- Bounds for the Perron root, singularity/nonsingularity conditions, and eigenvalue inclusion sets
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- The smallest 2-connected cubic bipartite planar nonhamiltonian graph
- On proper edge 3-colorings of a cubic graph
- Jungles: A new solution to the host/parasite phylogeny reconciliation problem
- Balancedness and the least eigenvalue of Laplacian of signed graphs
- On Hamilton's ideals
- The dichromatic number of a digraph
- Spins and fermions on arbitrary lattices
- Optimal algorithms for comparing trees with labeled leaves
- Boundary graph classes for some maximum induced subgraph problems
- M-polynomial of generalized transformation graphs
- Commuting conjugacy class graphs of finite groups
- A seven-color theorem on the sphere
- The relation of matching with inverse degree of a graph
- Towards the reconstruction of posets
- Automates finis et ensembles normaux. (Finite automata and normal sets)
- Law of the iterated logarithm for sums of non-linear functions of Gaussian variables that exhibit a long range dependence
- On metric properties of certain clique graphs
- On the distance signless Laplacian spectrum of graphs
- On subgraphs as matroid cells
- An optimal parallel algorithm for minimum spanning trees in planar graphs
- Characterization of n-path graphs and of graphs having \(n\)-th root
- \(\mathcal{S}\)-index of certain line graph of subdivision graphs
- Natural/random protein classification models based on star network topological indices
- Broadcasting on random recursive trees
- The Ising model and percolation on trees and tree-like graphs
- Fullerenes and disk-fullerenes
- A majorization method for localizing graph topological indices
- A note on the complexity of matching patterns with variables
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Expansions of Chromatic Polynomials and Log-Concavity
- Compactifications of the Generalized Jacobian Variety
- On the Decomposition of Graphs
- The analysis of a nested dissection algorithm
- On the construction of a new generalization of Runge-Kutta methods
- Ramsey Numbers for the Pair Sparse Graph-Path or Cycle
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 Q5572939)
