Results 21 to 30 of about 4,659 (167)
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
A Note on Graph Colorings and Graph Polynomials
Journal of Combinatorial Theory, Series B, 1997 Given a graph \(G\), form a polynomial \(\prod (x_i-x_j)\) where the product is over all edges \((i,j)\) with \(i < j\). If \(G\) is not \(k\)-colourable, then no matter how the variables \(x_i\) are assigned integers from \(1\) to \(k\) the polynomial is zero. Hence the graph polynomial encodes chromatic properties of the graph.
Noga Alon, Michael Tarsi
openaire +2 more sources
CoRR, 2018 We study the time complexity of induced subgraph isomorphism problems where the pattern graph is fixed. The earliest known example of an improvement over trivial algorithms is by Itai and Rodeh (1978) who sped up triangle detection in graphs using fast matrix multiplication.
Markus Bläser +2 more
openaire +4 more sources
Computing Wiener and Hyper-Wiener Indices of Zero-Divisor Graph of ℤℊ3×ℤI1I2
Journal of Function Spaces, 2022 Let S=ℤℊ3×ℤI1I2 be a commutative ring where ℊ,I1 and I2 are positive prime integers with I1≠I2. The zero-divisor graph assigned to S is an undirected graph, denoted as YS with vertex set V(Y(S)) consisting of all Zero-divisor of the ring S and for any c,
Yonghong Liu +4 more
doaj +1 more source
On coefficients of circuit polynomials and characteristic polynomials
International Journal of Mathematics and Mathematical Sciences, 1985 Results are given from which expressions for the coefficients of the simple circuit polynomial of a graph can be obtained in terms of subgraphs of the graph. From these are deduced parallel results for the coefficients of the characteristic polynomial of
E. J. Farrell
doaj +1 more source
A novel approach for the system of coupled differential equations using clique polynomials of graph
Partial Differential Equations in Applied Mathematics, 2022 This study proposed an efficient numerical technique for coupled differential equations (CDEs) using the clique polynomials of the Complete graph. Recently, Graph theory has dragged the attention of many mathematicians due to its wide applications. Here,
Kumbinarasaiah S., Manohara G.
doaj +1 more source
Omega, Sadhana, and PI Polynomials of Quasi-Hexagonal Benzenoid Chain
Journal of Analytical Methods in Chemistry, 2020 Counting polynomials are important graph invariants whose coefficients and exponents are related to different properties of chemical graphs. Three closely related polynomials, i.e., Omega, Sadhana, and PI polynomials, dependent upon the equidistant edges
Nazeran Idrees +5 more
doaj +1 more source
Interlace polynomials of lollipop and tadpole graphs
Electronic Journal of Graph Theory and Applications, 2022 In this paper, we examine interlace polynomials of lollipop andtadpole graphs. The lollipop and tadpole graphs are similar in that they bothinclude a path attached to a graph by a single vertex.
Christina L Eubanks-Turner +2 more
doaj +1 more source
Topological invariants for the line graphs of some classes of graphs
Open Chemistry, 2019 Graph theory plays important roles in the fields of electronic and electrical engineering. For example, it is critical in signal processing, networking, communication theory, and many other important topics.
Zhou Xiaoqing +5 more
doaj +1 more source
Advances in Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source