scientific article; zbMATH DE number 3419161

From MaRDI portal
Revision as of 04:32, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5682013

zbMath0266.05108MaRDI QIDQ5682013

Frank Harary, Edgar M. Palmer

Publication date: 1973


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (only showing first 100 items - show all)

Classification of small (0, 1) matricesCounting ordered graphs that avoid certain subgraphsAn analysis of Monte Carlo algorithms for counting problemsAnalytical expressions for Wiener indices of \(n\)-circumscribed peri-condensed benzenoid graphsThe number of trees with a 1-factorOn isomorphisms of Marušič-Scapellato graphsMonotonically labelled Motzkin treesAn asymptotic analysis of labeled and unlabeled \(k\)-treesRedfield's papers and their relevance to counting isomers and isomerizationsSome applications of graph theory to the study of polymer configurationBinomial-combinatorial properties of Clar structuresA logical approach to asymptotic combinatorics I. First order propertiesSurvival under random coverings of treesSome methods for computing component distribution probabilities in relational structuresOn strongly asymmetric and controllable primitive graphsA note on the number of leftist treesEnumerating phylogenetic trees with multiple labelsVariations on the Ising problemMatchings in benzene chainsOn the generalized iterates of Yeh's combinatorial \({\mathbb{K}}\)-species\(k\)-connectivity in random graphsThe complexity of computing the permanentBirth and growth of multicyclic components in random hypergraphsCataloguing general graphs by point and line spectraAsymptotic enumeration of extensional acyclic digraphsThe enumeration of connected graphs and linked diagramsThe asymptotic number of non-isomorphic rooted trees obtained by rooting a treeA generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariantsEnumeration of point-determining graphsCertificates for properties of stability polynomials of graphsEnumeration of bipartite graphs and bipartite blocksThe full cycles in a Young cosetA study of the dynamics of multi-player games on small networks using territorial interactionsJordan splittings of almost unimodular integral quadratic formsOn the Wiener index of random treesCounting non-isomorphic three-connected planar mapsCounting labelled three-connected and homeomorphically irreducible two- connected graphsCounting unlabelled three-connected and homeomorphically irreducible two- connected graphsGraph theoretic modelsOn graphs with given automorphism groupA probabilistic proof of an asymptotic formula for the number of labelled regular graphsReconstructing graphs from cut-set sizesThe first cycles in an evolving graphUnprovability threshold for the planar graph minor theoremThe degree profile of random Pólya treesBoolean distance for graphsRoots of Ehrhart polynomials arising from graphsPeriodic oscillations of coefficients of power series that satisfy functional equationsRelations among tautological classes revisitedEnumerating stereo-isomers of tree-like polyinositolsCounting glycans revisitedEnumerations, forbidden subgraph characterizations, and the split-decompositionA theory of even functionals and their algorithmic applicationsNested wreath groups and their applications to phylogeny in biology and Cayley trees in chemistry and physicsCode for polyomino and computer search of isospectral polyominoesGeneral combinatorial schemas: Gaussian limit distributions and exponential tailsBalancing the \(n\)-cube: A census of coloringsOn the symmetry and asymmetry of combinatorial structuresSelf-similarity in the combinatorial theory of orthogonal polynomialsPeriodic solutions for the Schrödinger equation with nonlocal smoothing nonlinearities in higher dimensionThe specification of 2-treesThe inverse problem for certain tree parametersMatrix integrals and map enumeration: an accessible introductionEnumeration of connected graphs with cut verticesChain hexagonal cacti: matchings and independent setsThe asymptotic value of the Randić index for treesDynamic resource location with tropical algebraSets with involutions: power group enumerationAlternating quaternary algebra structures on irreducible representations of \(\mathfrak{sl}_2(\mathbb C)\)Gaussian limiting distributions for the number of components in combinatorial structures\(e\): the master of allIs hyper-extensionality preservable under deletions of graph elements?Exact unprovability results for compound well-quasi-ordered combinatorial classesStructure of Jackson integrals of \(BC_n\) typeThe enumeration of bipartite graphsOn the number of trees in a random forestMean characteristics of Gibbsian point processesOn the parity of the Wiener indexThe characters of the wreath product group acting on the homology groups of the Dowling latticesNew bijective links on planar maps via orientationsThe monoids of orders eight, nine \& ten.Almost all graphs are rigid-revisitedOn the average shape of monotonically labelled tree structuresEnumeration of connected invariant graphsCounting and coding identity trees with fixed diameter and bounded degreeOn an asymptotic evaluation of the cycle index of the symmetric groupMinimal algebras of infinite representation type with preprojective componentMatchings in pentagonal chainsOn labeled vertex-transitive digraphs with a prime number of verticesPoints by degree and orbit size in chemical trees. IISymbolic calculation of the trace of the power of a tridiagonal matrixThe chromatic polynomial of an unlabeled graphIsomorphic factorizations VIII: Bisectable treesOn the succinct representation of graphsAn invariant theory approach to graph enumerationCounting labelled chordal graphsAn investigation of Runge-Kutta processes, and equivalence of scalar and vector casesAn asymptotic expansion for the coefficients of some power series. II: Lagrange inversionPer-spectral and adjacency spectral characterizations of a complete graph removing six edgesMetric transforms of finite spaces and connected graphs







This page was built for publication: