A neigborhood union condition for nonadjacent vertices in graphs
DOI10.1142/S1793830917500604zbMATH Open1386.05067OpenAlexW2742849155MaRDI QIDQ4595248FDOQ4595248
Authors: F. 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
Recommendations
Association schemes, strongly regular graphs (05E30) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)
Cites Work
- Graph theory
- The zero-divisor graph of a commutative ring
- The annihilating-ideal graph of commutative rings. I
- On the coloring of the annihilating-ideal graph of a commutative ring
- A note on graphical representation of rings
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- On neighborhood condition for graphs to have [\(a\), \(b\)]-factors
- Neighbourhood unions and Hamiltonian properties in graphs
- The comaximal graph of a lattice
- A neighborhood condition for vertices at distance two implying Hamiltonicity
- The effects of distance and neighborhood union conditions on hamiltonian properties in graphs
- Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs
- The central vertices and radius of the regular graph of ideals
Cited In (2)
This page was built for publication: A neigborhood union condition for nonadjacent vertices in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595248)
