A neigborhood union condition for nonadjacent vertices in graphs

DOI10.1142/S1793830917500604zbMath1386.05067OpenAlexW2742849155MaRDI QIDQ4595248

Farzad Shaveisi

Publication date: 29 November 2017

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830917500604

zbMATH Keywords

bipartitecycleneighborhood\(N\)-bounded graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On the coloring of the annihilating-ideal graph of a commutative ring
• Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs
• A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
• Neighbourhood unions and Hamiltonian properties in graphs
• The zero-divisor graph of a commutative ring
• On neighborhood condition for graphs to have [\(a\), \(b\)-factors]
• A note on graphical representation of rings
• The comaximal graph of a lattice
• THE ANNIHILATING-IDEAL GRAPH OF COMMUTATIVE RINGS I
• The effects of distance and neighborhood union conditions on hamiltonian properties in graphs
• The central vertices and radius of the regular graph of ideals

This page was built for publication: A neigborhood union condition for nonadjacent vertices in graphs