FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3136296313> ?p ?o ?g. }

• W3136296313 endingPage "22" @default.
• W3136296313 startingPage "1" @default.
• W3136296313 abstract "Accessibility, robustness, and connectivity are the salient structural properties of networks. The labelling of networks with numeric numbers using the parameters of edge or vertex weights plays an eminent role in the study of the aforesaid properties. The systems interlinked in a network are transformed into a graphical network, and specific numeric labels assigned to the converted network under certain rules assist us in the regulation of data traffic, bandwidth, and coding/decoding of signals. Two major classes of such network labellings are magic and antimagic. The notion of super <math xmlns=http://www.w3.org/1998/Math/MathML id=M1><mfenced open=( close=) separators=|><mrow><mi>a</mi><mo>,</mo><mn>0</mn></mrow></mfenced></math> edge-antimagic labelling on networks was identified in the late nineties. The present article addresses super <math xmlns=http://www.w3.org/1998/Math/MathML id=M2><mfenced open=( close=) separators=|><mrow><mi>a</mi><mo>,</mo><mn>0</mn></mrow></mfenced></math> edge antimagicness of union of the networks’ star <math xmlns=http://www.w3.org/1998/Math/MathML id=M3><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math> , the path <math xmlns=http://www.w3.org/1998/Math/MathML id=M4><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi></mrow></msub></math> , and copies of paths and the rooted product of cycle <math xmlns=http://www.w3.org/1998/Math/MathML id=M5><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub></math> with <math xmlns=http://www.w3.org/1998/Math/MathML id=M6><msub><mrow><mi>K</mi></mrow><mrow><mn>2</mn><mo>,</mo><mi>m</mi></mrow></msub></math> . We also provide super <math xmlns=http://www.w3.org/1998/Math/MathML id=M7><mfenced open=( close=) separators=|><mrow><mi>a</mi><mo>,</mo><mn>0</mn></mrow></mfenced></math> edge-antimagic labelling of the rooted product of cycle <math xmlns=http://www.w3.org/1998/Math/MathML id=M8><msub><mrow><mi>C</mi></mrow><mrow><mi>n</mi></mrow></msub></math> and planar pancyclic networks. Further, we design a super <math xmlns=http://www.w3.org/1998/Math/MathML id=M9><mfenced open=( close=) separators=|><mrow><mi>a</mi><mo>,</mo><mn>0</mn></mrow></mfenced></math> edge-antimagic labelling on a pancyclic network containing chains of <math xmlns=http://www.w3.org/1998/Math/MathML id=M10><msub><mrow><mi>C</mi></mrow><mrow><mn>6</mn></mrow></msub></math> and three different symmetrically designed lattices. Moreover, our findings have also been recapitulated in the shape of 3- <math xmlns=http://www.w3.org/1998/Math/MathML id=M11><mi>D</mi></math> plots and tables." @default.
• W3136296313 created "2021-03-29" @default.
• W3136296313 creator A5037349396 @default.
• W3136296313 creator A5042091837 @default.
• W3136296313 creator A5047881296 @default.
• W3136296313 creator A5074332972 @default.
• W3136296313 date "2021-03-19" @default.
• W3136296313 modified "2023-10-07" @default.
• W3136296313 title "Computing Edge Weights of Symmetric Classes of Networks" @default.
• W3136296313 cites W1859201397 @default.
• W3136296313 cites W1999792423 @default.
• W3136296313 cites W2040151942 @default.
• W3136296313 cites W2068394052 @default.
• W3136296313 cites W2079557922 @default.
• W3136296313 cites W2086781107 @default.
• W3136296313 cites W2093891422 @default.
• W3136296313 cites W2124375752 @default.
• W3136296313 cites W2158850316 @default.
• W3136296313 cites W2289927529 @default.
• W3136296313 cites W2320814884 @default.
• W3136296313 cites W2399919305 @default.
• W3136296313 cites W2440816051 @default.
• W3136296313 cites W2559210534 @default.
• W3136296313 cites W2590076302 @default.
• W3136296313 cites W2797140204 @default.
• W3136296313 cites W2961212878 @default.
• W3136296313 cites W4300108389 @default.
• W3136296313 cites W2138070550 @default.
• W3136296313 doi "https://doi.org/10.1155/2021/5562544" @default.
• W3136296313 hasPublicationYear "2021" @default.
• W3136296313 type Work @default.
• W3136296313 sameAs 3136296313 @default.
• W3136296313 citedByCount "0" @default.
• W3136296313 crossrefType "journal-article" @default.
• W3136296313 hasAuthorship W3136296313A5037349396 @default.
• W3136296313 hasAuthorship W3136296313A5042091837 @default.
• W3136296313 hasAuthorship W3136296313A5047881296 @default.
• W3136296313 hasAuthorship W3136296313A5074332972 @default.
• W3136296313 hasBestOaLocation W31362963131 @default.
• W3136296313 hasConcept C114614502 @default.
• W3136296313 hasConcept C118615104 @default.
• W3136296313 hasConcept C33923547 @default.
• W3136296313 hasConcept C41008148 @default.
• W3136296313 hasConceptScore W3136296313C114614502 @default.
• W3136296313 hasConceptScore W3136296313C118615104 @default.
• W3136296313 hasConceptScore W3136296313C33923547 @default.
• W3136296313 hasConceptScore W3136296313C41008148 @default.
• W3136296313 hasLocation W31362963131 @default.
• W3136296313 hasLocation W31362963132 @default.
• W3136296313 hasOpenAccess W3136296313 @default.
• W3136296313 hasPrimaryLocation W31362963131 @default.
• W3136296313 hasRelatedWork W1412164264 @default.
• W3136296313 hasRelatedWork W1978042415 @default.
• W3136296313 hasRelatedWork W1978225469 @default.
• W3136296313 hasRelatedWork W1978588354 @default.
• W3136296313 hasRelatedWork W2017331178 @default.
• W3136296313 hasRelatedWork W2567026640 @default.
• W3136296313 hasRelatedWork W2799759016 @default.
• W3136296313 hasRelatedWork W2976797620 @default.
• W3136296313 hasRelatedWork W3086542228 @default.
• W3136296313 hasRelatedWork W3103555317 @default.
• W3136296313 hasVolume "2021" @default.
• W3136296313 isParatext "false" @default.
• W3136296313 isRetracted "false" @default.
• W3136296313 magId "3136296313" @default.
• W3136296313 workType "article" @default.