Results 61 to 70 of about 4,659 (167)
Entropy due to Fragmentation of Dendrimers [PDF]
Surveys in Mathematics and its Applications, 2009 Subgraphs can results through application of criteria based on matrix which characterize the entire graph. The most important categories of criteria are the ones able to produce connected subgraphs (fragments). Based on theoretical frame on graph theory,
Sorana D. Bolboacă, Lorentz Jäntschi
doaj
Structural differentiation of graphs using Hosoya-based indices. [PDF]
PLoS ONE, 2014 In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a graph. The first measure combines structural information captured by partial Hosoya polynomials and graph spectra. The latter is a graph entropy measure which
Matthias Dehmer +2 more
doaj +1 more source
The Characteristic Polynomials of Symmetric Graphs [PDF]
Symmetry, 2018 In this paper, we study the way the symmetries of a given graph are reflected in its characteristic polynomials. Our aim is not only to find obstructions for graph symmetries in terms of its polynomials but also to measure how faithful these algebraic invariants are with respect to symmetry.
Chbili, Nafaa +3 more
openaire +1 more source
A Graph Polynomial for Independent Sets of Bipartite Graphs [PDF]
Combinatorics, Probability and Computing, 2012 We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings, the number of perfect matchings, and, for bipartite graphs, the number of independent sets (#BIS).We analyse the complexity of exact evaluation of the polynomial at rational points and show a dichotomy result: for most points exact ...
Qi Ge, Daniel Stefankovic
openaire +4 more sources
Homomorphism and sigma polynomials
International Journal of Mathematics and Mathematical Sciences, 1995 By establishing a connection between the sigma polynomial and the homomorphism polynomial, many of the proofs for computing the sigma polynmial are simplified, the homomorphism polynomial can be identified for several new classes of graphs, and progress ...
Richard Alan Gillman
doaj +1 more source
Journal of Graph Algorithms and Applications, 2015 Many well-known graph drawing techniques, including force-directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations.
Michael Bannister +3 more
doaj +1 more source
Discrete Mathematics, 2003 The chain polynomial of a graph was introduced in \textit{R. C. Read} and \textit{E. G. Whitehead jun.} [Discrete Math. 204, 337-356 (1999; Zbl 0960.05050)], where some basic properties of these polynomials were given as well. In the present paper further properties are investigated and the gained results are used to compute the chain polynomials of ...
openaire +2 more sources
Chromatic Polynomials of Oriented Graphs
The Electronic Journal of Combinatorics, 2019 The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying simple graph, closing an open problem posed by Sopena.
Danielle Cox, Christopher Duffy 0001
openaire +4 more sources
Counting Polynomials on Regular Iterative Structures [PDF]
Applied Medical Informatics, 2009 Subgraphs can results through application of criteria based on matrix which characterize the entire graph. The most important categories of criteria are the ones able to produce connected subgraphs (fragments). Theoretical frame on graph theory, a series
Lorentz JÄNTSCHI +2 more
doaj
Zeros of Jones Polynomials of Graphs
The Electronic Journal of Combinatorics, 2015 In this paper, we introduce the Jones polynomial of a graph $G=(V,E)$ with $k$ components as the following specialization of the Tutte polynomial:$$J_G(t)=(-1)^{|V|-k}t^{|E|-|V|+k}T_G(-t,-t^{-1}).$$We first study its basic properties and determine certain extreme coefficients.
Fengming Dong, Xian'an Jin
openaire +2 more sources