Cover Image

On roots of domination polynomials for friendship and book graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Rather, Bilal Ahmad
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Discrete Mathematics Complex Variables Primary 05C69, Secondary 05C31, 30C15 F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Independent domination polynomial of comaximal graphs of commutative rings
by: Rather, Bilal Ahmad
Published: (2026)

Explicit Formulas and Unimodality Phenomena for General Position Polynomials
by: Rather, Bilal Ahmad
Published: (2026)

Vertex connectivity of the nonzero nonunit core of the comaximal graph of $\mathbb Z_n$
by: Rather, Bilal Ahmad
Published: (2026)

A note on the Independent domination polynomial of zero divisor graph of rings
by: Rather, Bilal Ahmad
Published: (2024)

Domination polynomial of co-maximal graphs of integer modulo ring
by: Rather, Bilal Ahmad
Published: (2026)

Block Structure and Spectrum of Zero-Divisor Graphs of Lipschitz Quaternion Rings Modulo \(n\)
by: Rather, Bilal Ahmad
Published: (2026)

Log-concavity of the independence polynomials of $\mathbf{W}_{p}$ graphs
by: Hoang, Do Trong, et al.
Published: (2024)

On corona of Konig-Egervary graphs
by: Levit, Vadim E., et al.
Published: (2024)

Extremal chromatic bounds for distance Laplacian eigenvalues
by: Rather, Bilal Ahmad
Published: (2026)

Graph polynomials: some questions on the edge
by: Farr, Graham, et al.
Published: (2024)

On (distance) Laplacian characteristic polynomials of power graphs
by: Rather, Bilal Ahmad, et al.
Published: (2026)

On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property
by: Levit, Vadim E., et al.
Published: (2024)

Almost Bipartite non-König-Egerváry Graphs Revisited
by: Levit, Vadim E., et al.
Published: (2024)

Closing Trees into Unicyclic Counterexamples
by: Levit, Vadim E., et al.
Published: (2026)

Degree-Based Weighted Adjacency Matrices: Spectra, Integrality, and Edge Deletion Effects
by: Rather, Bilal Ahmad, et al.
Published: (2026)

The family of all local maximum independent sets is an augmentoid
by: Levit, Vadim E., et al.
Published: (2026)

On the complexity of Sandwich Problems for $M$-partitions
by: Barsukov, Alexey, et al.
Published: (2026)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)

Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity
by: Lalou, Mohammed, et al.
Published: (2025)

On coloring graphs with well-distributed edge density
by: Hassan, Syed Mujtaba, et al.
Published: (2024)

Spectral Properties of Zero-Divisor Graphs of Truncated Polynomial Rings
by: Rather, Bilal Ahmad
Published: (2026)

Linear recurrences for non-log-concave independence polynomials of trees
by: Bautista-Ramos, César, et al.
Published: (2026)

Directed branch-width: A directed analogue of tree-width
by: Bumpus, Benjamin Merlin, et al.
Published: (2020)

Forbidden paths and cycles in the undirected underlying graph of a 2-quasi best match graph
by: Korchmaros, Annachiara
Published: (2024)

Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)

Domination and packing in graphs
by: Gómez, Renzo, et al.
Published: (2024)

Quasi-kernels in split graphs
by: Langlois, Hélène, et al.
Published: (2023)

On the Alon-Tarsi Number of Some Line and Total graphs
by: Prajnanaswaroopa, S.
Published: (2023)

Secure Total Domination Number in Maximal Outerplanar Graphs
by: Aita, Yasufumi, et al.
Published: (2024)

A Lower bound for Secure Domination Number of an Outerplanar Graph
by: Araki, Toru
Published: (2024)

Sparse Induced Subgraphs of Large Treewidth
by: Bonnet, Édouard
Published: (2024)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)

Conflict-Free Colouring of Subsets
by: Jartoux, Bruno, et al.
Published: (2022)

A CSP approach to Graph Sandwich Problems
by: Bodirsky, Manuel, et al.
Published: (2025)

Recognizing Relating Edges in Graphs without Cycles of Length 6
by: Levit, Vadim E., et al.
Published: (2024)

The Path-Extremal Conjecture for Zero Forcing: Distance-Hereditary Graphs and a Split-Decomposition Reduction
by: German, Samuel
Published: (2026)

Graphs with core(G) = nucleus(G)
by: Levit, Vadim E., et al.
Published: (2026)

New Optimal Results on Codes for Location in Graphs
by: Junnila, Ville, et al.
Published: (2023)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

Tree-independence number VI. Thetas and pyramids
by: Chudnovsky, Maria, et al.
Published: (2025)