Results 11 to 20 of about 7,067 (209)
Problems on chromatic polynomials of hypergraphs
Electronic Journal of Graph Theory and Applications, 2020 Chromatic polynomials of graphs have been studied extensively for around one century. The concept of chromatic polynomial of a hypergraph is a natural extension of chromatic polynomial of a graph. It also has been studied for more than 30 years.
Ruixue Zhang, Fengming Dong
doaj +2 more sources
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Farr, G.E., G.E. Farr
openaire +2 more sources
On the graceful polynomials of a graph. [PDF]
Australas. J Comb., 2019 Every graph can be associated with a family of homogeneous polynomials, one for every degree, having as many variables as the number of vertices. These polynomials are related to graceful labellings: a graceful polynomial with all even coefficients is a basic tool, in some cases, for proving that a graph is non-graceful, and for generating a possibly ...
Andrea Vietri
openaire +3 more sources
Computing F-index, coindex and Zagreb polynomials of the kth generalized transformation graphs
Heliyon, 2020 In chemical graph theory, forgotten topological index or F-index plays a crucial role to collect information about the properties of chemical compounds. The kth generalized transformation graphs of a molecular graph preserve the entire information on the
Durbar Maji, Ganesh Ghorai
doaj +1 more source
Omega, Sadhana, Theta, and PI Polynomials of Double Benzonoid Chain
Journal of Mathematics, 2022 Counting polynomials are closely related to certain features of chemical graphs and provide an elegant means of expressing graph topological invariants.
Fozia Bashir Farooq +3 more
doaj +1 more source
The Neighborhood Polynomial of Chordal Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its vertices that have a common neighbor. We introduce a parameter for chordal graphs called anchor width and an algorithm to compute the neighborhood polynomial which runs in ...
Helena Bergold +2 more
openaire +4 more sources
A novel method to construct cospectral graphs based on RT operation [PDF]
AIP AdvancesThis paper presents a new graph operation, RT(G), which is formed by transforming each vertex and edge of the original graph G into a triangle. We analyze the relationship between the signless Laplacian characteristic polynomials of the graph RT(G) and ...
Xiu-Jian Wang +2 more
doaj +1 more source
Polytopes from Subgraph Statistics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We study polytopes that are convex hulls of vectors of subgraph densities. Many graph theoretical questions can be expressed in terms of these polytopes, and statisticians use them to understand exponential random graph models.
Alexander Engström, Patrik Norén
doaj +1 more source
The interlace polynomial of a graph
Journal of Combinatorial Theory, Series B, 2004 To appear in J.
Richard Arratia +2 more
openaire +2 more sources
Smarandache-Zagreb Index on Three Graph Operators [PDF]
, 2010 Many researchers have studied several operators on a connected graph in which one make an attempt on subdivision of its edges. In this paper, we show how the Zagreb indices, a particular case of Smarandache-Zagreb index of a graph changes with these ...
Ranjini, P.S., Lokesha, V.
core +1 more source