Isolation Number of Transition Graphs
Let <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>G</mi><mo>=</mo><mo>(</mo><mi>V</mi><mo>,</mo><mi>E</mi><mo>)</mo>...
Saved in:
Main Authors: | Junhao Qu, Shumin Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-12-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/13/1/116 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Longest cycles in certain bipartite graphs
by: Pak-Ken Wong
Published: (1998-01-01) -
Relations between the distinguishing number and some other graph parameters
by: Bahman Ahmadi, et al.
Published: (2024-11-01) -
Decomposition of hypercube graphs into paths and cycles having k edges
by: D. Saranya, et al.
Published: (2025-01-01) -
𝕮-inverse of graphs and mixed graphs
by: Alomari Omar, et al.
Published: (2025-02-01) -
An introduction of F-graphs, a graph-theoretic representation of natural numbers
by: E. J. Farrell
Published: (1992-01-01)