由某些二元运算产生的图的最大线性森林

Asian Research Journal of Mathematics Pub Date : 2023-07-25 DOI:10.9734/arjom/2023/v19i10720

Isagani S. Cabahug Jr.

{"title":"由某些二元运算产生的图的最大线性森林","authors":"Isagani S. Cabahug Jr.","doi":"10.9734/arjom/2023/v19i10720","DOIUrl":null,"url":null,"abstract":"For a connected nontrivial graph G, the maximum linear forest of G is the linear forest having maximum number of edges. The number of edges in a maximum linear forest is denoted by \\(\\ell\\)`(G). In this paper we determine the maximum linear forest of the join and union of nontrivial connected graphs G and H , denoted by G + H and G \\(\\cup\\) H , respectively.","PeriodicalId":281529,"journal":{"name":"Asian Research Journal of Mathematics","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Maximum Linear Forest of Graphs Resulting from Some Binary Operations\",\"authors\":\"Isagani S. Cabahug Jr.\",\"doi\":\"10.9734/arjom/2023/v19i10720\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a connected nontrivial graph G, the maximum linear forest of G is the linear forest having maximum number of edges. The number of edges in a maximum linear forest is denoted by \\\\(\\\\ell\\\\)`(G). In this paper we determine the maximum linear forest of the join and union of nontrivial connected graphs G and H , denoted by G + H and G \\\\(\\\\cup\\\\) H , respectively.\",\"PeriodicalId\":281529,\"journal\":{\"name\":\"Asian Research Journal of Mathematics\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asian Research Journal of Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9734/arjom/2023/v19i10720\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asian Research Journal of Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9734/arjom/2023/v19i10720","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

对于连通非平凡图G, G的最大线性森林是边数最多的线性森林。最大线性森林中的边数用\(\ell\)’(G)表示。本文确定了非平凡连通图G和H的连接与并的最大线性森林，分别用G + H和G \(\cup\) H表示。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Maximum Linear Forest of Graphs Resulting from Some Binary Operations

For a connected nontrivial graph G, the maximum linear forest of G is the linear forest having maximum number of edges. The number of edges in a maximum linear forest is denoted by \(\ell\)`(G). In this paper we determine the maximum linear forest of the join and union of nontrivial connected graphs G and H , denoted by G + H and G \(\cup\) H , respectively.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Asian Research Journal of Mathematics

自引率

0.00%

发文量