The Upper Bound of the Edge Mostar Index with Respect to Bicyclic Graphs
Let <i>G</i> be a connected graph; the edge Mostar index <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>M</mi><msub><mi>o</mi><mi>e</mi></msub><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></semantics></math></inline-formula> of <i>G</i> is...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
MDPI AG
2023-05-01
|
| Saila: | Mathematics |
| Gaiak: | |
| Sarrera elektronikoa: | https://www.mdpi.com/2227-7390/11/11/2506 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|